Остановите войну!
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 50 matches
- 2005
- Scott Aaronson:
Guest Column: NP-complete problems and physical reality. SIGACT News 36(1): 30-52 (2005) - Foto N. Afrati:
Report on PODS 2005. SIGACT News 36(3): 39-40 (2005) - Amir M. Ben-Amram:
The Church-Turing thesis and its look-alikes. SIGACT News 36(3): 113-114 (2005) - E. Jonathan Chapin:
Review of "Integer Programming, by Laurence A. Wolsey", Wiley and Sons 1998. SIGACT News 36(3): 10-12 (2005) - Marek Chrobak:
SIGACT news online algorithms column 8. SIGACT News 36(3): 67 (2005) - Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert:
On quantum versions of record-breaking algorithms for SAT. SIGACT News 36(4): 103-108 (2005) - Maulik A. Dave:
Review of "Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenge by Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch", American Mathematical Society 2002. SIGACT News 36(4): 5-8 (2005) - Reza Dorrigiv, Alejandro López-Ortiz:
A Survey of Performance Measures for On-line Algorithms. SIGACT News 36(3): 67-81 (2005) - Georg Essl:
Review of "Computational Line Geometry, by H. Pottmann and J. Wallner", Springer Verlag, 2001. SIGACT News 36(3): 13-17 (2005) - William Fahle:
Review of "Graphs, Networks, and Algorithms (second edition) by Dieter Jungnickel", Springer-Verlag 2005. SIGACT News 36(4): 12-14 (2005) - Dror G. Feitelson, Ahuva Mu'alem:
On the definition of "on-line" in job scheduling problems. SIGACT News 36(1): 122-131 (2005) - Ulisses Ferreira:
The sets of real and complex numbers are denumerable. SIGACT News 36(2): 126-130 (2005) - William I. Gasarch:
Review of "Proofs that Really Count: The Art of Combinatorial Proof by Arthur T. Benjamin and Jennifer J. Quinn"; MAA, 2003. SIGACT News 36(1): 12-14 (2005) - William I. Gasarch:
The book review column. SIGACT News 36(2): 3-4 (2005) - William I. Gasarch:
Review of "Cryptological Mathematics by Robert Lewand"; MAA, 2000, $33.95, Softcover. SIGACT News 36(2): 4-7 (2005) - William I. Gasarch:
The book review column. SIGACT News 36(3): 4-5 (2005) - William I. Gasarch:
The book review column. SIGACT News 36(4): 4-5 (2005) - James Glenn:
Review of "Teaching Statistics Using Baseball, by Jim Albert", MAA, 2003. SIGACT News 36(3): 19-21 (2005) - Lane A. Hemaspaandra:
SIGACT news complexity theory column 48. SIGACT News 36(3): 24-38 (2005) - Lane A. Hemaspaandra:
SIGACT news complexity theory column 49. SIGACT News 36(4): 24-35 (2005) - Sandy Irani, Kirk Pruhs:
Algorithmic problems in power management. SIGACT News 36(2): 63-76 (2005) - Wojciech Jawor:
Three dozen papers on online algorithms. SIGACT News 36(1): 71-85 (2005) - Isaiah Pinchas Kantorovitz:
A note on turing machine computability of rule driven systems. SIGACT News 36(4): 109-110 (2005) - Jonathan Katz:
Comparative book review: Cryptography: An Introduction by V. V. Yaschenko (American Mathematical Society, 2002); Cryptanalysis of Number Theoretic Ciphers by S.S. Wagstaff, Jr. (Chapman & Hall/CRC Press, 2003); RSA and Public-Key Cryptography by R. A. Mollin (Chapman & Hall/CRC Press, 2003); Foundations of Cryptography, vol. 1: Basic Tools by O. Goldreich, (Cambridge University Press, 2001). SIGACT News 36(2): 14-19 (2005) - Dean F. Kelley:
Technical report column. SIGACT News 36(3): 22-23 (2005) - Subhash Khot:
Guest column: inapproximability results via Long Code based PCPs. SIGACT News 36(2): 25-42 (2005) - Samir Khuller:
Four colors suffice! SIGACT News 36(2): 43-44 (2005) - Mats Kindahl:
Review of "Types and Programming Languages by Benjamin C. Pierce"; The MIT Press, 2002. SIGACT News 36(1): 15-20 (2005) - Vladik Kreinovich, Luc Longpré:
Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures). SIGACT News 36(3): 107-112 (2005) - Alejandro López-Ortiz:
Algorithmic foundations of the internet. SIGACT News 36(2): 45-62 (2005)
skipping 20 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-05-12 06:00 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