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 41 matches
- 2001
- Jeremy Avigad:
Review of "Basic proof theory: second edition" by A. S. Troelstra and H. Schwichtenberg. Cambridge University Press. SIGACT News 32(2): 15-19 (2001) - William I. Gasarch:
The book review column. SIGACT News 32(1): 2-3 (2001) - William I. Gasarch:
The book review column. SIGACT News 32(2): 3-4 (2001) - William I. Gasarch:
Review of "The CodeBreakers: the story of secrete writing" by David Kahn. Scribner. SIGACT News 32(2): 5-6 (2001) - William I. Gasarch:
The book review column. SIGACT News 32(4): 2-5 (2001) - William I. Gasarch:
Review of Proofs and Refutations: author of book: Imre Lakatos. SIGACT News 32(4): 6-8 (2001) - Cyril Gavoille:
Routing in distributed networks: overview and open problems. SIGACT News 32(1): 36-52 (2001) - David Harel, Dexter Kozen, Jerzy Tiuryn:
Dynamic logic. SIGACT News 32(1): 66-69 (2001) - Lane A. Hemaspaandra:
SIGACT news complexity theory column 31. SIGACT News 32(1): 21-31 (2001) - Lane A. Hemaspaandra:
SIGACT News complexity theory column 32. SIGACT News 32(2): 32-43 (2001) - Lane A. Hemaspaandra:
Complexity theory. SIGACT News 32(3): 40-52 (2001) - Lane A. Hemaspaandra:
SIGACT news complexity theory column 34. SIGACT News 32(4): 24-33 (2001) - Lane A. Hemaspaandra
, Mitsunori Ogihara:
The complexity theory companion. SIGACT News 32(4): 66-68 (2001) - Lisa Higham:
Report on DISC'00. SIGACT News 32(1): 32-36 (2001) - John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman:
Introduction to automata theory, languages, and computation, 2nd edition. SIGACT News 32(1): 60-65 (2001) - Christopher G. Jennings:
Review of Analysis of Algorithms: An Active Learning Approach: author of book Jeffrey J. McConnell. SIGACT News 32(4): 17-18 (2001) - Idit Keidar, Sergio Rajsbaum:
On the cost of fault-tolerant consensus when there are no faults: preliminary version. SIGACT News 32(2): 45-63 (2001) - Samir Khuller:
Algorithms column. SIGACT News 32(2): 28-31 (2001) - Vladik Kreinovich:
Itanium's new basic operation of fused multiply-add: theoretical explanation and theoretical challenge. SIGACT News 32(1): 115-117 (2001) - Hassan Masum:
Review of Data Structures and Algorithms in Java (2nd ed): Michael T Goodrich and Roberto Tamassia. SIGACT News 32(1): 3-5 (2001) - Hassan Masum:
Review of How to Solve It: Modern Heuristics: Zbigniew Michalewicz and David B Fogel. SIGACT News 32(1): 8-12 (2001) - Timothy H. McNicholl:
A review of Selected Papers on Analysis of Algorithms: by Donald E. Knuth. SIGACT News 32(1): 5-8 (2001) - Timothy H. McNicholl:
Review of "Complexity and real computation" by Blum, Cucker, Shub, and Smale. Springer-Verlag. SIGACT News 32(2): 14-15 (2001) - Joseph S. B. Mitchell, Joseph O'Rourke:
Computational geometry. SIGACT News 32(3): 63-72 (2001) - Michael Mitzenmacher:
Challenging students with creative assignments. SIGACT News 32(1): 70-73 (2001) - Michael Mitzenmacher:
An experimental assignment on random processes. SIGACT News 32(1): 74-78 (2001) - Joseph O'Rourke:
Computational geometry column 41. SIGACT News 32(1): 53-55 (2001) - Mitsunori Ogihara:
Review of "DNA based computers V" by Eric Winfree and David K. Gifford. American Mathematics Society. SIGACT News 32(2): 11-13 (2001) - Riccardo Pucella:
Review of proof, language, and interaction: essays in honour of Robin Milner edited by Plotkin, Stirling and Tofte. SIGACT News 32(1): 12-16 (2001) - Riccardo Pucella:
Review of Dynamic Logic (Foundations of Computing): authors of book: D. Harel, D. Kozen and J. Tiuryn. SIGACT News 32(4): 9-17 (2001)
skipping 11 more matches
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 2024-11-29 14:10 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:
