Остановите войну!
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 32 matches
- 2007
- Dimitris Achlioptas, Frank McSherry:
Fast computation of low-rank matrix approximations. J. ACM 54(2): 9 (2007) - Dimitris Achlioptas, Assaf Naor, Yuval Peres:
On the maximum satisfiability of random formulas. J. ACM 54(2): 10 (2007) - Arne Andersson, Mikkel Thorup:
Dynamic ordered sets with exponential search trees. J. ACM 54(3): 13 (2007) - Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer:
A characterization of regular expressions under bisimulation. J. ACM 54(2): 6 (2007) - Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs:
Speed scaling to manage energy and temperature. J. ACM 54(1): 3:1-3:39 (2007) - Jan A. Bergstra, John V. Tucker:
The rational numbers as an abstract data type. J. ACM 54(2): 7 (2007) - Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta:
(Almost) Tight bounds and existence theorems for single-commodity confluent flows. J. ACM 54(4): 16 (2007) - Ling Cheung, Mariëlle Stoelinga, Frits W. Vaandrager:
A testing scenario for probabilistic processes. J. ACM 54(6): 29 (2007) - Sara Cohen, Werner Nutt, Yehoshua Sagiv:
Deciding equivalences among conjunctive aggregate queries. J. ACM 54(2): 5 (2007) - Vincent Conitzer, Tuomas Sandholm, Jérôme Lang:
When are elections with few candidates hard to manipulate?. J. ACM 54(3): 14 (2007) - Vincent Danos, Elham Kashefi, Prakash Panangaden:
The measurement calculus. J. ACM 54(2): 8 (2007) - Irit Dinur:
The PCP theorem by gap amplification. J. ACM 54(3): 12 (2007) - Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Priority sampling for estimation of arbitrary subset sums. J. ACM 54(6): 32 (2007) - Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson:
On counting homomorphisms to directed acyclic graphs. J. ACM 54(6): 27 (2007) - Thomas Eiter, Kazuhisa Makino:
On computing all abductive explanations from a propositional Horn theory. J. ACM 54(5): 24 (2007) - Faith Ellen, Panagiota Fatourou, Eric Ruppert:
Time lower bounds for implementations of multi-writer snapshots. J. ACM 54(6): 30 (2007) - Andrew Gilpin, Tuomas Sandholm:
Lossless abstraction of imperfect information games. J. ACM 54(5): 25 (2007) - Martin Grohe:
The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54(1): 1:1-1:24 (2007) - Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden:
Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54(3): 11 (2007) - Sibsankar Haldar, K. Vidyasankar:
On specification of Read/Write shared variables. J. ACM 54(6): 31 (2007) - Sean Hallgren:
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. J. ACM 54(1): 4:1-4:19 (2007) - Joseph Y. Halpern, Riccardo Pucella:
Characterizing and reasoning about probabilistic and non-probabilistic expectation. J. ACM 54(3): 15 (2007) - Tero Harju, Dirk Nowotka:
Periodicity and unbordered words: A proof of the extended duval conjecture. J. ACM 54(4): 20 (2007) - Jean-Pierre Jouannaud, Albert Rubio:
Polymorphic higher-order recursive path orderings. J. ACM 54(1): 2:1-2:48 (2007) - Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A new look at survey propagation and its generalizations. J. ACM 54(4): 17 (2007) - Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani:
AdWords and generalized online matching. J. ACM 54(5): 22 (2007) - Rafail Ostrovsky, Yuval Rabani:
Low distortion embeddings for edit distance. J. ACM 54(5): 23 (2007) - Mark Rudelson, Roman Vershynin:
Sampling from large matrices: An approach through geometric functional analysis. J. ACM 54(4): 21 (2007) - Eijiro Sumii, Benjamin C. Pierce:
A bisimulation for type abstraction and recursion. J. ACM 54(5): 26 (2007) - Mikkel Thorup:
Equivalence between priority queues and sorting. J. ACM 54(6): 28 (2007)
skipping 2 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-07-04 04:34 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