Остановите войну!
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 80 matches
- 2009
- Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani:
The detectability lemma and quantum gap amplification. STOC 2009: 417-426 - Reid Andersen, Yuval Peres:
Finding sparse cuts locally using evolving sets. STOC 2009: 235-244 - Alexandr Andoni, Krzysztof Onak:
Approximating edit distance in near-linear time. STOC 2009: 199-204 - Boris Aronov, Esther Ezra, Micha Sharir:
Small-size epsilon-nets for axis-parallel rectangles and boxes. STOC 2009: 639-648 - Sanjeev Arora, Constantinos Daskalakis, David Steurer:
Message passing algorithms and improved LP decoding. STOC 2009: 3-12 - Per Austrin, Johan Håstad:
Randomly supported independence and resistance. STOC 2009: 483-492 - Yossi Azar, Iftah Gamzu, Xiaoxin Yin:
Multiple intents re-ranking. STOC 2009: 669-678 - László Babai, Robert Beals, Ákos Seress:
Polynomial-time theory of matrix groups. STOC 2009: 55-64 - Leonid Barenboim, Michael Elkin:
Distributed (delta+1)-coloring in linear (in delta) time. STOC 2009: 111-120 - MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami:
MaxMin allocation via degree lower-bounded arborescences. STOC 2009: 543-552 - Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava:
Twice-ramanujan sparsifiers. STOC 2009: 255-262 - Eli Ben-Sasson, Swastik Kopparty:
Affine dispersers from subspace polynomials. STOC 2009: 65-74 - Aaron Bernstein, David R. Karger:
A nearly optimal oracle for avoiding failed vertices and edges. STOC 2009: 101-110 - Eric Blais:
Testing juntas nearly optimally. STOC 2009: 151-158 - Jin-yi Cai, Pinyan Lu, Mingji Xia:
Holant problems and counting CSP. STOC 2009: 715-724 - Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An efficient algorithm for partial order production. STOC 2009: 93-100 - Jivitej S. Chadha, Naveen Garg, Amit Kumar, V. N. Muralidhara:
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation. STOC 2009: 679-684 - Jérémie Chalopin, Daniel Gonçalves:
Every planar graph is the intersection graph of segments in the plane: extended abstract. STOC 2009: 631-638 - Erin W. Chambers, Jeff Erickson, Amir Nayyeri:
Homology flows, cohomology cuts. STOC 2009: 273-282 - Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Integrality gaps for Sherali-Adams relaxations. STOC 2009: 283-292 - Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
Fault-tolerant spanners for general graphs. STOC 2009: 435-444 - Jing Chen, Silvio Micali:
A new approach to auctions and resilient mechanism design. STOC 2009: 503-512 - Qi Cheng, Daqing Wan:
A deterministic reduction for the gap minimum distance problem: [extended abstract]. STOC 2009: 33-38 - Kenneth L. Clarkson, David P. Woodruff:
Numerical linear algebra in the streaming model. STOC 2009: 205-214 - Richard Cleve, Daniel Gottesman, Michele Mosca, Rolando D. Somma, David L. Yonge-Mallo:
Efficient discrete-time simulations of continuous-time quantum query algorithms. STOC 2009: 409-416 - Constantinos Daskalakis, Christos H. Papadimitriou:
On oblivious PTAS's for nash equilibrium. STOC 2009: 75-84 - Martin Dietzfelbinger, Philipp Woelfel:
Tight lower bounds for greedy routing in uniform small world rings. STOC 2009: 591-600 - Yevgeniy Dodis, Yael Tauman Kalai, Shachar Lovett:
On cryptography with auxiliary input. STOC 2009: 621-630 - Yevgeniy Dodis, Daniel Wichs:
Non-malleable extractors and symmetric key cryptography from weak secrets. STOC 2009: 601-610 - Cynthia Dwork, Jing Lei:
Differential privacy and robust statistics. STOC 2009: 371-380
skipping 50 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-30 13: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