Остановите войну!
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 86 matches
- 2005
- Scott Aaronson:
The complexity of agreement. STOC 2005: 634-643 - Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore:
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. STOC 2005: 694-703 - Micah Adler, Jeff Edmonds, Jirí Matousek:
Towards asymptotic optimality in probabilistic packet marking. STOC 2005: 450-459 - Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev:
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. STOC 2005: 573-581 - Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan:
Derandomization of auctions. STOC 2005: 619-625 - Luis von Ahn, Nicholas J. Hopper, John Langford:
Covert two-party computation. STOC 2005: 513-522 - Nir Ailon, Moses Charikar, Alantha Newman:
Aggregating inconsistent information: ranking and clustering. STOC 2005: 684-693 - Miklós Ajtai:
Representing hard lattices with O(n log n) bits. STOC 2005: 94-103 - Michael Alekhnovich:
Lower bounds for k-DNF resolution on random 3-CNFs. STOC 2005: 251-256 - Michael Alekhnovich, Sanjeev Arora, Iannis Tourlakis:
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. STOC 2005: 294-303 - Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
Quadratic forms on graphs. STOC 2005: 486-493 - Noga Alon, Asaf Shapira:
Every monotone graph property is testable. STOC 2005: 128-137 - Matthew Andrews, Lisa Zhang:
Hardness of the undirected edge-disjoint paths problem. STOC 2005: 276-283 - Matthew Andrews, Lisa Zhang:
Hardness of the undirected congestion minimization problem. STOC 2005: 284-293 - Sanjeev Arora, James R. Lee, Assaf Naor:
Euclidean distortion and the sparsest cut. STOC 2005: 553-562 - Baruch Awerbuch, Yossi Azar, Amir Epstein:
The Price of Routing Unsplittable Flow. STOC 2005: 57-66 - Yossi Azar, Amir Epstein:
Convex programming for scheduling unrelated parallel machines. STOC 2005: 331-337 - Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos:
Low-distortion embeddings of general metrics into the line. STOC 2005: 225-233 - Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. STOC 2005: 1-10 - Saugata Basu:
Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities. STOC 2005: 313-322 - Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing the first Betti number and the connected components of semi-algebraic sets. STOC 2005: 304-312 - Michael Ben-Or, Avinatan Hassidim:
Fast quantum byzantine agreement. STOC 2005: 481-485 - Eli Ben-Sasson, Madhu Sudan:
Simple PCPs with poly-log rate and query complexity. STOC 2005: 266-275 - Itai Benjamini, Oded Schramm, David Bruce Wilson:
Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read. STOC 2005: 244-250 - Andrej Bogdanov:
Pseudorandom generators for low degree polynomials. STOC 2005: 21-30 - Mikolaj Bojanczyk, Thomas Colcombet:
Tree-walking automata do not recognize all regular languages. STOC 2005: 234-243 - Patrick Briest, Piotr Krysta, Berthold Vöcking:
Approximation techniques for utilitarian mechanism design. STOC 2005: 39-48 - Moses Charikar, Adriana Karagiozova:
On non-uniform multicommodity buy-at-bulk network design. STOC 2005: 176-182 - Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
Multicommodity flow, well-linked terminals, and routing problems. STOC 2005: 183-192 - Xi Chen, Xiaotie Deng:
On algorithms for discrete and approximate brouwer fixed points. STOC 2005: 323-330
skipping 56 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-04-25 20:08 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