Остановите войну!
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 33 matches
- 2004
- Scott Aaronson, Yaoyun Shi:
Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51(4): 595-605 (2004) - Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan:
Approximating extent measures of points. J. ACM 51(4): 606-635 (2004) - Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications. J. ACM 51(2): 139-186 (2004) - Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Polynomial-time data reduction for dominating set. J. ACM 51(3): 363-384 (2004) - Albert Atserias:
On sufficient conditions for unsatisfiability of random formulas. J. ACM 51(2): 281-311 (2004) - Luca Becchetti, Stefano Leonardi:
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM 51(4): 517-539 (2004) - Dimitris Bertsimas, Santosh S. Vempala:
Solving convex programs by random walks. J. ACM 51(4): 540-556 (2004) - Peter Bürgisser, Martin Lotz:
Lower bounds on the bounded coefficient complexity of bilinear maps. J. ACM 51(3): 464-482 (2004) - Ran Canetti, Oded Goldreich, Shai Halevi:
The random oracle methodology, revisited. J. ACM 51(4): 557-594 (2004) - Chung-Min Chen, Christine T. Cheng:
From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries. J. ACM 51(1): 46-73 (2004) - Valter Crescenzi, Giansalvatore Mecca:
Automatic information extraction from large websites. J. ACM 51(5): 731-779 (2004) - Camil Demetrescu, Giuseppe F. Italiano:
A new approach to dynamic all pairs shortest paths. J. ACM 51(6): 968-992 (2004) - Shlomi Dolev, Jennifer L. Welch:
Self-stabilizing clock synchronization in the presence of Byzantine faults. J. ACM 51(5): 780-799 (2004) - Cynthia Dwork, Moni Naor, Amit Sahai:
Concurrent zero-knowledge. J. ACM 51(6): 851-898 (2004) - Alan M. Frieze, Ravi Kannan, Santosh S. Vempala:
Fast monte-carlo algorithms for finding low-rank approximations. J. ACM 51(6): 1025-1041 (2004) - Georg Gottlob, Christoph Koch:
Monadic datalog and the expressive power of languages for Web information extraction. J. ACM 51(1): 74-113 (2004) - Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick:
Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51(2): 312-362 (2004) - Johan Håstad, Mats Näslund:
The security of all RSA and discrete log bits. J. ACM 51(2): 187-230 (2004) - Jan M. Hochstein, Karsten Weihe:
Edge-disjoint routing in plane switch graphs in linear time. J. ACM 51(4): 636-670 (2004) - Mark Jerrum, Alistair Sinclair, Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4): 671-697 (2004) - Ravi Kannan, Santosh S. Vempala, Adrian Vetta:
On clusterings: Good, bad and spectral. J. ACM 51(3): 497-515 (2004) - David Kempe, Jon M. Kleinberg, Alan J. Demers:
Spatial gossip and resource location protocols. J. ACM 51(6): 943-967 (2004) - Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan:
Segmentation problems. J. ACM 51(2): 263-280 (2004) - Phokion G. Kolaitis, Victor Vianu:
Foreword. J. ACM 51(1): 1 (2004) - Vladlen Koltun:
Almost tight upper bounds for vertical decompositions in four dimensions. J. ACM 51(5): 699-730 (2004) - Gerome Miklau, Dan Suciu:
Containment and equivalence for a fragment of XPath. J. ACM 51(1): 2-45 (2004) - Moni Naor, Omer Reingold:
Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2): 231-262 (2004) - Wojciech Plandowski:
Satisfiability of word equations with constants is in PSPACE. J. ACM 51(3): 483-496 (2004) - Ran Raz:
Resolution lower bounds for the weak pigeonhole principle. J. ACM 51(2): 115-138 (2004) - Oded Regev:
New lattice-based cryptographic constructions. J. ACM 51(6): 899-942 (2004)
skipping 3 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-18 06:37 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