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 4,197 matches
- 2024
- Dmitry Sokolov
:
Random (log n)-CNF Are Hard for Cutting Planes (Again). STOC 2024: 2008-2015 - Zachary Chase, Bogdan Chornomaz, Shay Moran, Amir Yehudayoff:
Local Borsuk-Ulam, Stability, and Replicability. STOC 2024: 1769-1780 - Mohsen Ghaffari, Christoph Grunau:
Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time. STOC 2024: 1184-1191 - Mohsen Ghaffari, Christoph Grunau:
Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping. STOC 2024: 1889-1900 - Sergey Bravyi, David Gosset, Yinchen Liu:
Classical Simulation of Peaked Shallow Quantum Circuits. STOC 2024: 561-572 - Lijie Chen, Shuichi Hirahara, Hanlin Ren:
Symmetric Exponential Time Requires Near-Maximum Circuit Size. STOC 2024: 1990-1999 - Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak:
Approximating Small Sparse Cuts. STOC 2024: 319-330 - Yang Cai, Christopher Liaw, Aranyak Mehta, Mingfei Zhao:
The Power of Two-Sided Recruitment in Two-Sided Markets. STOC 2024: 201-212 - Lorenzo Beretta, Aviad Rubinstein:
Approximate Earth Mover's Distance in Truly-Subquadratic Time. STOC 2024: 47-58 - Mohsen Ghaffari, Brandon Wang:
Lenzen's Distributed Routing Generalized: A Full Characterization of Constant-Time Routability. STOC 2024: 1877-1888 - Ce Jin, Yinzhan Xu:
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. STOC 2024: 1573-1584 - Michal Koucký, Michael E. Saks:
Almost Linear Size Edit Distance Sketch. STOC 2024: 956-967 - Rafael Oliveira, Akash Kumar Sengupta:
Strong Algebras and Radical Sylvester-Gallai Configurations. STOC 2024: 95-105 - Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
A Nearly Quadratic-Time FPTAS for Knapsack. STOC 2024: 283-294 - Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. STOC 2024: 1165-1173 - Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka:
New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. STOC 2024: 935-943 - Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang:
Minimum Star Partitions of Simple Polygons in Polynomial Time. STOC 2024: 904-910 - Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
Prize-Collecting Steiner Tree: A 1.79 Approximation. STOC 2024: 1641-1652 - Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, Yuping Ye:
Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem. STOC 2024: 1739-1749 - Omar Alrabiah, Venkatesan Guruswami, Ray Li:
Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields. STOC 2024: 1458-1469 - Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. STOC 2024: 764-775 - Nima Anari, Ruiquan Gao, Aviad Rubinstein:
Parallel Sampling via Counting. STOC 2024: 537-548 - Nima Anari, Frederic Koehler, Thuy-Duong Vuong:
Trickle-Down in Localization Schemes and Applications. STOC 2024: 1094-1105 - Anurag Anshu, Nikolas P. Breuckmann, Quynh T. Nguyen:
Circuit-to-Hamiltonian from Tensor Networks and Fault Tolerance. STOC 2024: 585-595 - Itai Arad, Raz Firanko, Rahul Jain:
An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP. STOC 2024: 1311-1322 - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. STOC 2024: 106-117 - Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan:
O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. STOC 2024: 847-858 - Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-pass Lower Bounds for MST in Dynamic Streams. STOC 2024: 835-846 - Yakov Babichenko, Michal Feldman, Ron Holzman, Vishnu V. Narayan:
Fair Division via Quantile Shares. STOC 2024: 1235-1246 - Mitali Bafna, Dor Minzer:
Characterizing Direct Product Testing via Coboundary Expansion. STOC 2024: 1978-1989
skipping 4,167 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-11-05 04:06 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:
