Остановите войну!
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 94 matches
- 2015
- Richard Cole, Vasilis Gkatzelis:
Approximating the Nash Social Welfare with Indivisible Items. STOC 2015: 371-380 - Abhishek Bhowmick, Shachar Lovett:
The List Decoding Radius of Reed-Muller Codes over Small Fields. STOC 2015: 277-285 - Scott Aaronson, Andris Ambainis:
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing. STOC 2015: 307-316 - Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller Codes for Random Erasures and Errors. STOC 2015: 297-306 - Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu:
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. STOC 2015: 41-50 - Amirali Abdullah, Suresh Venkatasubramanian:
A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds. STOC 2015: 509-518 - Ittai Abraham, Danny Dolev:
Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity. STOC 2015: 605-614 - Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski:
Non-malleable Reductions and Applications. STOC 2015: 459-468 - Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract. STOC 2015: 733-742 - Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. STOC 2015: 625-634 - Joël Alwen, Vladimir Serbinenko:
High Parallel Complexity Graphs and Memory-Hard Functions. STOC 2015: 595-603 - Andris Ambainis, Yuval Filmus, François Le Gall:
Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method. STOC 2015: 585-593 - Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn:
Sketching and Embedding are Equivalent for Norms. STOC 2015: 479-488 - Alexandr Andoni, Ilya P. Razenshteyn:
Optimal Data-Dependent Hashing for Approximate Near Neighbors. STOC 2015: 793-801 - Arturs Backurs, Piotr Indyk:
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). STOC 2015: 51-58 - Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi:
Sparse Quantum Codes from Quantum Circuits. STOC 2015: 327-334 - Nikhil Bansal, Anupam Gupta, Guru Guruganesh:
On the Lovász Theta function for Independent Sets in Sparse Graphs. STOC 2015: 193-200 - Nikhil Bansal, Janardhan Kulkarni:
Minimizing Flow-Time on Unrelated Machines. STOC 2015: 851-860 - Boaz Barak, Siu On Chan, Pravesh K. Kothari:
Sum of Squares Lower Bounds from Pairwise Independence. STOC 2015: 97-106 - Boaz Barak, Jonathan A. Kelner, David Steurer:
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. STOC 2015: 143-151 - Siddharth Barman:
Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem. STOC 2015: 361-369 - Raef Bassily, Adam D. Smith:
Local, Private, Efficient Protocols for Succinct Histograms. STOC 2015: 127-135 - Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis:
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. STOC 2015: 173-182 - Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang:
Succinct Randomized Encodings and their Applications. STOC 2015: 439-448 - Jean Bourgain, Sjoerd Dirksen, Jelani Nelson:
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space. STOC 2015: 499-508 - Gábor Braun, Sebastian Pokutta, Daniel Zink:
Inapproximability of Combinatorial Problems via Small LPs and SDPs. STOC 2015: 107-116 - Mark Braverman, Ankit Garg:
Small Value Parallel Repetition for General Games. STOC 2015: 335-340 - Mark Braverman, Omri Weinstein:
An Interactive Information Odometer and Applications. STOC 2015: 341-350 - Guy Bresler:
Efficiently Learning Ising Models on Arbitrary Graphs. STOC 2015: 771-782 - Ran Canetti, Justin Holmgren, Abhishek Jain, Vinod Vaikuntanathan:
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs. STOC 2015: 429-437
skipping 64 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-24 17:46 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