default search action
Search 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 28 matches
- 1994
- Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
How hard are n2-hard problems? SIGACT News 25(2): 83-85 (1994) - Gilles Brassard:
Quantum computing: the end of classical cryptography? SIGACT News 25(4): 15-21 (1994) - Antônio Carlos da Rocha Costa, Vanderlei Moraes Rodrigues:
Inspecting continuations. SIGACT News 25(2): 90-91 (1994) - Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet:
Semi-membership algorithms: some recent advances. SIGACT News 25(3): 12-23 (1994) - Lance Fortnow, Stuart A. Kurtz, Duke Whang:
The infinite version of an open communication complexity problem is independent of the axioms of set theory. SIGACT News 25(1): 87-89 (1994) - James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman:
Wide area technical report service - technical reports online. SIGACT News 25(3): 124-127 (1994) - William I. Gasarch:
Book Review: Finite Automata, Formal Logic, and Circuit Complexity. By Howard Straubing. (Birkhauser. 1994. xii+226pp. ISBN 0-8176-3719-2. $39.50.). SIGACT News 25(3): 28-32 (1994) - Oded Goldreich:
A taxonomy of proof systems (part 2). SIGACT News 25(1): 22-30 (1994) - Yuri Gurevich:
Logic activities in Europe. SIGACT News 25(2): 11-24 (1994) - Michael T. Hallett, Todd Wareham:
A compendium of parameterized complexity results. SIGACT News 25(3): 122-123 (1994) - Lane A. Hemaspaandra:
Complexity theory column 5: the not-ready-for-prime-time conjectures. SIGACT News 25(2): 5-10 (1994) - Lane A. Hemaspaandra:
Teaching Computational Complexity: Resources to Treasure. SIGACT News 25(4): 2-11 (1994) - Jean-Pierre Jouannaud:
Book Review: A Proof Theory for General Unification. By Wayne Snyder. (Birkhauser, 1991. vi+175 pages. ISBN 0-8176-3593-9. $28.00). SIGACT News 25(2): 25 (1994) - Paris C. Kanellakis:
Database querying and constraint programming. SIGACT News 25(4): 22-87 (1994) - Alejandro López-Ortiz:
Linear pattern matching of repeated substrings. SIGACT News 25(3): 114-121 (1994) - Armando B. Matos:
An introduction to ultimately periodic sets of integers. SIGACT News 25(1): 90-96 (1994) - Joseph O'Rourke:
Computational geometry. SIGACT News 25(1): 31-33 (1994) - Joseph O'Rourke:
Computational geometry column 23. SIGACT News 25(3): 24-27 (1994) - Joseph O'Rourke:
Computational Geometry Column 24. SIGACT News 25(4): 12-14 (1994) - Ian Parberry:
A form for referees in theoretical computer science. SIGACT News 25(4): 96-102 (1994) - Holger Petersen:
Two-way one-counter automata accepting bounded languages. SIGACT News 25(3): 102-105 (1994) - Rajeev Raman:
A simpler analysis of algorithm 65 (find). SIGACT News 25(2): 86-89 (1994) - Kenneth W. Regan, Jie Wang:
The quasilinear isomorphism challenge. SIGACT News 25(3): 106-113 (1994) - Rocky Ross:
EDUCATION FORUM: Project Impact: : NSF-Funded Science Education Projects. SIGACT News 25(3): 49-52 (1994) - Rocky Ross:
Education Forum: The Dynalab Animation System. SIGACT News 25(4): 49-54 (1994) - Frank Vlach:
Book Review: The Deductive Foundations of Computer Programming. By Zohar Manna and Richard Waldinger. (Addison-Wesley, 1993. xiv+717pp. ISBN 0-201-54886-0. $46.25). SIGACT News 25(2): 26-27 (1994) - In memoriam Eugene L. Lawler. SIGACT News 25(4): 108-109 (1994)
- Thomas Zeugmann:
Report on COLT 1994. SIGACT News 25(4): 88-95 (1994)
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-09 23:09 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