Остановите войну!
for scientists:
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 41 matches
- 1998
- Pankaj K. Agarwal, Joseph O'Rourke:
Computational geometry. SIGACT News 29(3): 27-32 (1998) - Anish Arora:
Book Review: Verification of Sequential and Concurrent Programs by Krzysztof R. Apt and Ernst-Riidiger Olderog (Springer-Verlag New York, 1997). SIGACT News 29(3): 46-48 (1998) - Randeep Bhatia, Yoram J. Sussmann:
Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997). SIGACT News 29(2): 17-20 (1998) - Avrim Blum, Prabhakar Raghavan:
On a theory of computing symposia. SIGACT News 29(3): 104-111 (1998) - Pierluigi Crescenzi, Viggo Kann:
How to find the best approximation results. SIGACT News 29(4): 90-97 (1998) - Alexander Dekhtyar:
Book Review: Vicious Circles by Jon Barwise and Lawrence Moss (Cambridge University Press 1996). SIGACT News 29(4): 10-14 (1998) - William I. Gasarch:
The Book Review Column. SIGACT News 29(1): 2 (1998) - William I. Gasarch:
The Book Review Column. SIGACT News 29(2): 17 (1998) - William I. Gasarch:
The Book Review Column. SIGACT News 29(3): 43 (1998) - William I. Gasarch:
The Book Review Column. SIGACT News 29(4): 2-4 (1998) - Sanjay Gupta:
Book Review: Theories of Computability by Nicholas Pippenger (Cambridge University Press 1997). SIGACT News 29(4): 5-10 (1998) - Lane A. Hemaspaandra:
Take-home complexity. SIGACT News 29(2): 9-13 (1998) - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses. SIGACT News 29(3): 10-22 (1998) - Lane A. Hemaspaandra, Alan L. Selman:
Writing and editing complexity theory: tales and tools. SIGACT News 29(4): 20-27 (1998) - Andy Huang:
Computation of the Knuth-Morris-Pratt skip tables. SIGACT News 29(3): 59-61 (1998) - Jerry James:
Book Review: Algorithms and Programming: Problems and Solutions by Alexander Shen (Birkhauser Boston, 1997). SIGACT News 29(3): 48-52 (1998) - Samir Khuller:
Open problems: 16. SIGACT News 29(1): 15-17 (1998) - Samir Khuller:
Book review: Selected Papers on Computer Science by Donald E. Knuth. SIGACT News 29(2): 21-26 (1998) - Neal Koblitz:
Book Review: Discrete Mathematics in the Schools. Ed. by Joseph G. Rosenstein, Deborah S. Franzblau, and Fred S. Roberts (American Mathematical Society). SIGACT News 29(1): 8-12 (1998) - Alexander E. Kostin, Svetlana A. Tchoudaikina:
Yet another reachability algorithm for Petri nets. SIGACT News 29(4): 98-110 (1998) - Harry R. Lewis, Christos H. Papadimitriou:
Elements of the Theory of Computation. SIGACT News 29(3): 62-78 (1998) - Luc Longpré:
Report on COMPLEXITY 1998. SIGACT News 29(3): 92-93 (1998) - Peter W. O'Hearn:
Polymorphism, objects and abstract types. SIGACT News 29(4): 39-50 (1998) - Joseph O'Rourke:
Computational geometry column 33. SIGACT News 29(2): 14-20 (1998) - Ian Parberry:
Everything you wanted to know about the running time of Mergesort but were afraid to ask. SIGACT News 29(2): 50-57 (1998) - Jan Paredaens:
Database theory column: report on PODs '98. SIGACT News 29(3): 23-26 (1998) - Brian Postow:
Book Review: Basic Simple Type Theory by J. Roger Hindley (Cambridge University Press 1997). SIGACT News 29(1): 5-8 (1998) - Kirk Pruhs:
How to design dynamic programming algorithms sans recursion. SIGACT News 29(1): 32-35 (1998) - Rocky Ross:
EDUCATION FORUM: Reflections on Turning Fifty. SIGACT News 29(1): 21-31 (1998) - Rocky Ross:
Mathematics on the Web. SIGACT News 29(2): 33-41 (1998)
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-06-23 20:49 CEST 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