default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 1987
- Charles H. Bennett, Gilles Brassard:
Quantum public key distribution reinvented. SIGACT News 18(4): 51-53 (1987) - Leslie Burkholder:
The halting problem. SIGACT News 18(3): 48-60 (1987) - Charles B. Dunham:
Pessimization is unsolvable. SIGACT News 18(3): 37 (1987) - David Epstein:
On the NP-completeness of cryptarithms. SIGACT News 18(3): 38-40 (1987) - Rod McBeth:
A proof of generalized induction. SIGACT News 18(3): 31-36 (1987) - Anthony J. Dos Reis:
Regular languages under F-gsm mappings. SIGACT News 18(3): 41-45 (1987) - Anthony J. Dos Reis:
Regular languages do not form a lattice under GSM mappings. SIGACT News 18(3): 46-47 (1987) - Edmund Staples:
The tower of Hanoi problem with arbitrary start and end positions. SIGACT News 18(3): 61-64 (1987) - James M. Swenson:
A constructive proof of the countability of Σ*. SIGACT News 18(4): 48-50 (1987) - Shang-Hua Teng:
The construction of Huffman-equivalent prefix code in NC. SIGACT News 18(4): 54-61 (1987) - Kenneth L. Williams, Mohammad Reza Meybodi:
Representing problems as string transformations. SIGACT News 18(3): 29-30 (1987) - 1986
- Guo-Qiang Zhang:
An O(ln n) parallel algorithm for the subset sum problem. SIGACT News 18(2): 57-63 (1986) - Mike D. Atkinson, Nicola Santoro, Jorge Urrutia:
On the integer complexity of Boolean matrix multiplication. SIGACT News 18(1): 53 (1986) - Robert L. Bernstein:
Testing for semilattices. SIGACT News 18(1): 49-50 (1986) - A. K. Dewdney:
Experiments with a generic reduction computer. SIGACT News 18(1): 75-79 (1986) - Charles B. Dunham:
The cycle burning problem. SIGACT News 18(1): 51 (1986) - Hervé Gallaire, Jack Minker, Jean-Marie Nicolas:
Logic and databases: a response. SIGACT News 18(2): 52-56 (1986) - Colin Gerety, Paul Cull:
Time complexity of the Towers of Hanoi problem. SIGACT News 18(1): 80-87 (1986) - David Harel:
Logic and databases: a critique. SIGACT News 18(1): 68-74 (1986) - Dexter Kozen:
Fast parallel orthogonalization. SIGACT News 18(2): 47 (1986) - Rod McBeth:
The tree structure of exponential calculations - Addendum. SIGACT News 18(2): 64 (1986) - Ian Parberry:
Parallel speedup of sequential machines: a defense of parallel computation thesis. SIGACT News 18(1): 54-67 (1986) - Douglas H. Wiedemann:
Quantum cryptography. SIGACT News 18(2): 48-51 (1986) - D. M. Wilson:
The halting problem for Turning machines. SIGACT News 18(1): 52 (1986)
loading more results 
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-01-17 13:17 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
