Остановите войну!
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 87 matches
- 2015
- Emmanuel Abbe, Colin Sandon:
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery. FOCS 2015: 670-688 - Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
Tight Hardness Results for LCS and Other Sequence Similarity Measures. FOCS 2015: 59-78 - Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
If the Current Clique Algorithms are Optimal, So is Valiant's Parser. FOCS 2015: 98-117 - Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz:
Solving the Closest Vector Problem in 2n Time - The Discrete Gaussian Strikes Again! FOCS 2015: 563-582 - Saeed Alaei, Jason D. Hartline, Rad Niazadeh, Emmanouil Pountourakis, Yang Yuan:
Optimal Auctions vs. Anonymous Pricing. FOCS 2015: 1446-1463 - Sarah R. Allen, Ryan O'Donnell, David Witmer:
How to Refute a Random CSP. FOCS 2015: 689-708 - Josh Alman, Ryan Williams:
Probabilistic Polynomials and Hamming Nearest Neighbors. FOCS 2015: 136-150 - Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein:
Welfare Maximization with Limited Interaction. FOCS 2015: 1499-1512 - Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
Optimal Induced Universal Graphs and Adjacency Labeling for Trees. FOCS 2015: 1311-1326 - Nima Anari, Shayan Oveis Gharan:
Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP. FOCS 2015: 20-39 - Joseph Anderson, Navin Goyal, Anupama Nandi, Luis Rademacher:
Heavy-Tailed Independent Component Analysis. FOCS 2015: 290-309 - Gilad Asharov, Gil Segev:
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. FOCS 2015: 191-209 - John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. Roche, Eli Upfal:
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. FOCS 2015: 350-369 - Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson:
No Small Linear Program Approximates Vertex Cover within a Factor 2 - e. FOCS 2015: 1123-1142 - Dominic W. Berry, Andrew M. Childs, Robin Kothari:
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters. FOCS 2015: 792-809 - Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. FOCS 2015: 1480-1498 - Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from Functional Encryption. FOCS 2015: 171-190 - Charles Bordenave, Marc Lelarge, Laurent Massoulié:
Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs. FOCS 2015: 1347-1357 - Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. FOCS 2015: 773-791 - Jop Briët, Oded Regev, Rishi Saket:
Tight Hardness of the Non-commutative Grothendieck Problem. FOCS 2015: 1108-1122 - Karl Bringmann, Marvin Künnemann:
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. FOCS 2015: 79-97 - Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Differentially Private Release and Learning of Threshold Functions. FOCS 2015: 634-649 - Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams:
A Holant Dichotomy: Is the FKT Algorithm Universal? FOCS 2015: 1259-1276 - Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-Avoiding Access in Binary Search Trees. FOCS 2015: 410-423 - Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals:
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. FOCS 2015: 466-485 - Timothy M. Chan, Yakov Nekrich:
Towards an Optimal Method for Dynamic Planar Point Location. FOCS 2015: 390-409 - Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. FOCS 2015: 1464-1479 - Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng:
Mixture Selection, Mechanism Design, and Signaling. FOCS 2015: 1426-1445 - Flavio Chierichetti, Abhimanyu Das, Anirban Dasgupta, Ravi Kumar:
Approximate Modularity. FOCS 2015: 1143-1162 - Kenneth L. Clarkson, David P. Woodruff:
Input Sparsity and Hardness for Robust Subspace Approximation. FOCS 2015: 310-329
skipping 57 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-05-15 17:49 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