Остановите войну!
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 31 matches
- 2006
- Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani:
Computing with highly mixed states. J. ACM 53(3): 507-531 (2006) - Matthew Andrews, Lisa Zhang:
Logarithmic hardness of the undirected edge-disjoint paths problem. J. ACM 53(5): 745-761 (2006) - Albert Atserias, Anuj Dawar, Phokion G. Kolaitis:
On preservation under homomorphisms and unions of conjunctive queries. J. ACM 53(2): 208-237 (2006) - Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph:
Interface surfaces for protein-protein complexes. J. ACM 53(3): 361-378 (2006) - Amir M. Ben-Amram, Holger Petersen:
Backing up in singly linked lists. J. ACM 53(4): 681-705 (2006) - Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke:
A characterization of first-order topological properties of planar spatial data. J. ACM 53(2): 273-305 (2006) - Avrim Blum, Tuomas Sandholm, Martin Zinkevich:
Online algorithms for market clearing. J. ACM 53(5): 845-879 (2006) - Andrei A. Bulatov:
A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM 53(1): 66-120 (2006) - Benny Chor, Tamir Tuller:
Finding a maximum likelihood tree is hard. J. ACM 53(5): 722-744 (2006) - Julia Chuzhoy, Joseph Naor:
New hardness results for congestion minimization and machine scheduling. J. ACM 53(5): 707-721 (2006) - János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the Sum-of-Squares algorithm for bin packing. J. ACM 53(1): 1-65 (2006) - Daniela Pucci de Farias, Nimrod Megiddo:
Combining expert advice in reactive environments. J. ACM 53(5): 762-799 (2006) - Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée:
Hidden word statistics. J. ACM 53(1): 147-183 (2006) - Harold N. Gabow:
Using expander graphs to find vertex connectivity. J. ACM 53(5): 800-844 (2006) - Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan:
Dependent rounding and its applications to approximation algorithms. J. ACM 53(3): 324-360 (2006) - Oded Goldreich, Madhu Sudan:
Locally testable codes and PCPs of almost-linear length. J. ACM 53(4): 558-655 (2006) - Georg Gottlob, Christoph Koch, Klaus U. Schulz:
Conjunctive queries over trees. J. ACM 53(2): 238-272 (2006) - Piotr Indyk:
Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM 53(3): 307-323 (2006) - Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt:
Linear work suffix array construction. J. ACM 53(6): 918-936 (2006) - Yehuda Lindell, Anna Lysyanskaya, Tal Rabin:
On the composition of authenticated Byzantine Agreement. J. ACM 53(6): 881-917 (2006) - Ashwin Nayak, Julia Salzman:
Limits on the ability of quantum states to convey classical messages. J. ACM 53(1): 184-206 (2006) - Mark-Jan Nederhof, Giorgio Satta:
Probabilistic parsing strategies. J. ACM 53(3): 406-436 (2006) - Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli:
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T). J. ACM 53(6): 937-977 (2006) - Andrew M. Pitts:
Alpha-structural recursion and induction. J. ACM 53(3): 459-506 (2006) - Mark Scharbrodt, Thomas Schickinger, Angelika Steger:
A new average case analysis for completion time scheduling. J. ACM 53(1): 121-146 (2006) - Ori Shalev, Nir Shavit:
Split-ordered lists: Lock-free extensible hash tables. J. ACM 53(3): 379-405 (2006) - David B. Shmoys, Chaitanya Swamy:
An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53(6): 978-1012 (2006) - René A. Sitters, Leen Stougie:
The generalized two-server problem. J. ACM 53(3): 437-458 (2006) - Dan Suciu, Victor Vianu:
Introduction. J. ACM 53(2): 207 (2006) - Jeffrey Scott Vitter, David A. Hutchinson:
Distribution sort with randomized cycling. J. ACM 53(4): 656-680 (2006)
skipping 1 more match
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-15 09:58 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