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 93 matches
- 2019
- Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
A Deterministic Algorithm for Counting Colorings with 2-Delta Colors. FOCS 2019: 1380-1404 - Ashutosh Kumar, Raghu Meka, Amit Sahai:
Leakage-Resilient Secret Sharing Against Colluding Parties. FOCS 2019: 636-660 - Scott Aaronson, Daniel Grier, Luke Schaeffer:
A Quantum Query Complexity Trichotomy for Regular Languages. FOCS 2019: 942-965 - Emmanuel Abbe, Min Ye:
Reed-Muller Codes Polarize. FOCS 2019: 273-286 - Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair:
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. FOCS 2019: 725-744 - Dorit Aharonov, Alex Bredariol Grilo:
Stoquastic PCP vs. Randomness. FOCS 2019: 1000-1023 - Vedat Levi Alev, Fernando Granha Jeronimo, Madhur Tulsiani:
Approximating Constraint Satisfaction Problems on High-Dimensional Expanders. FOCS 2019: 180-201 - Josh Alman, Lijie Chen:
Efficient Construction of Rigid Matrices Using an NP Oracle. FOCS 2019: 1034-1055 - Nima Anari, Alireza Rezaei:
A Tight Analysis of Bethe Approximation for Permanent. FOCS 2019: 1434-1445 - Anurag Anshu, Naresh Goud Boddu, Dave Touchette:
Quantum Log-Approximate-Rank Conjecture is Also False. FOCS 2019: 982-994 - Benny Applebaum, Eliran Kachlon:
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. FOCS 2019: 171-179 - Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast Uniform Generation of Random Graphs with Given Degree Sequences. FOCS 2019: 1371-1379 - Sepehr Assadi, Sahil Singla:
Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. FOCS 2019: 233-248 - Albert Atserias, Moritz Müller:
Automating Resolution is NP-Hard. FOCS 2019: 498-509 - Yossi Azar, Noam Touitou:
General Framework for Metric Optimization Problems with Delay or with Deadlines. FOCS 2019: 60-71 - Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
Lower Bounds for Maximal Matchings and Maximal Independent Sets. FOCS 2019: 481-497 - Frank Ban, Xi Chen, Adam Freilich, Rocco A. Servedio, Sandip Sinha:
Beyond Trace Reconstruction: Population Recovery from the Deletion Channel. FOCS 2019: 745-768 - Nikhil Bansal, Ola Svensson, Luca Trevisan:
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. FOCS 2019: 910-928 - Zsolt Bartha, Nike Sun, Yumeng Zhang:
Breaking of 1RSB in Random Regular MAX-NAE-SAT. FOCS 2019: 1405-1416 - Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. FOCS 2019: 1615-1636 - Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS 2019: 382-405 - Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. FOCS 2019: 1637-1649 - Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding Monotone Patterns in Sublinear Time. FOCS 2019: 1469-1494 - Aditya Bhaskara, Aidao Chen, Aidan Perreault, Aravindan Vijayaraghavan:
Smoothed Analysis in Unsupervised Learning via Decoupling. FOCS 2019: 582-610 - Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Residual Based Sampling for Online Low Rank Approximation. FOCS 2019: 1596-1614 - Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. FOCS 2019: 406-423 - Jaroslaw Blasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek, Shravas Rao:
An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices. FOCS 2019: 1564-1567 - Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler:
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs. FOCS 2019: 1256-1280 - Jan van den Brand, Danupon Nanongkai:
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. FOCS 2019: 436-455 - Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. FOCS 2019: 456-480
skipping 63 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-10-21 04:03 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