default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 134 matches
- 2024
- Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki:
The Tractability Border of Reachability in Simple Vector Addition Systems with States. FOCS 2024: 1332-1354 - Nikhil Bansal, Vincent Cohen-Addad, Milind Prabhu, David Saulpic, Chris Schwiegelshohn:
Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds. FOCS 2024: 1707-1723 - Mohsen Ghaffari, Christoph Grunau:
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS. FOCS 2024: 2148-2179 - Nikhil Bansal, Dor Katzelnick, Roy Schwartz:
On Approximating Cutwidth and Pathwidth. FOCS 2024: 713-729 - Lijie Chen, Jiatu Li, Igor C. Oliveira:
Reverse Mathematics of Complexity Lower Bounds. FOCS 2024: 505-527 - Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting. FOCS 2024: 1294-1331 - Caleb Koch, Carmen Strassle, Li-Yang Tan:
Fast Decision Tree Learning Solves Hard Coding-Theoretic Problems. FOCS 2024: 1893-1910 - Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Towards Instance-Optimal Euclidean Spanners. FOCS 2024: 1579-1609 - Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. FOCS 2024: 1846-1873 - Eric Price, Zhiyang Xun:
Spectral Guarantees for Adversarial Streaming PCA. FOCS 2024: 1768-1785 - Siddhartha Jain, Jiawei Li, Robert Robere, Zhiyang Xun:
On Pigeonhole Principles and Ramsey in TFNP. FOCS 2024: 406-428 - Robert Andrews, Avi Wigderson:
Constant-Depth Arithmetic Circuits for Linear Algebra Problems. FOCS 2024: 2367-2386 - Mikkel Abrahamsen, Jack Stade:
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares. FOCS 2024: 1355-1371 - Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan:
Semi-Bandit Learning for Monotone Stochastic Optimization. FOCS 2024: 1260-1274 - Omar Alrabiah, Venkatesan Guruswami:
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles. FOCS 2024: 1874-1882 - Atul Singh Arora, Kishor Bharti, Alexandru Cojocaru, Andrea Coladangelo:
A Computational Test of Contextuality and, Even Simpler Proofs of Quantumness. FOCS 2024: 1106-1125 - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Trading Determinism for Noncommutativity in Edmonds' Problem. FOCS 2024: 539-559 - Mitali Bafna, Noam Lifshitz, Dor Minzer:
Constant Degree Direct Product Testers with Small Soundness. FOCS 2024: 862-869 - Ainesh Bakshi, Pravesh K. Kothari, Goutham Rajendran, Madhur Tulsiani, Aravindan Vijayaraghavan:
Efficient Certificates of Anti-Concentration Beyond Gaussians. FOCS 2024: 970-987 - Ainesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang:
High-Temperature Gibbs States are Unentangled and Efficiently Preparable. FOCS 2024: 1027-1036 - Ainesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang:
Structure Learning of Hamiltonians from Real-Time Evolution. FOCS 2024: 1037-1050 - Sandip Banerjee, Yair Bartal, Lee-Ad Gottlieb, Alon Hovav:
Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications. FOCS 2024: 1724-1767 - Rishabh Batra, Rahul Jain:
Commitments are Equivalent to Statistically-Verifiable One-Way State Generators. FOCS 2024: 1178-1192 - Soheil Behnezhad, Alma Ghafari:
Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs. FOCS 2024: 314-327 - Tolson Bell, Alan M. Frieze:
O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold. FOCS 2024: 106-119 - Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, Michal Koucký, William Kuszmaul, Michael E. Saks:
Nearly Optimal List Labeling. FOCS 2024: 2253-2274 - Michael A. Bender, William Kuszmaul, Renfei Zhou:
Tight Bounds for Classical Open Addressing. FOCS 2024: 636-657 - Thiago Bergamaschi, Chi-Fang Chen, Yunchao Liu:
Quantum Computational Advantage with Constant-Temperature Gibbs Sampling. FOCS 2024: 1063-1085 - Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu:
Maximum Flow by Augmenting Paths in n2+o(1) Time. FOCS 2024: 2056-2077 - Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang:
Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier. FOCS 2024: 2186-2201
skipping 104 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-12-12 06:43 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
