Skip to content

ACM Symposium on Theory of Computing

STOC

A*

CORE rank

CORE rank (raw)

A*

Acceptance rate

29.0% (2024)

Fields of research

Theory of Computation

Papers indexed

4,576

1969–2026

Papers per year

1969219 peak2026

STOC papers

4,576 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2015Sum of Squares Lower Bounds from Pairwise Independence.Boaz Barak, Siu On Chan, Pravesh K. Kothari
2015Minimizing Flow-Time on Unrelated Machines.Nikhil Bansal, Janardhan Kulkarni
2015On the Lovsz Theta function for Independent Sets in Sparse Graphs.Nikhil Bansal, Anupam Gupta, Guru Guruganesh
2015Sparse Quantum Codes from Quantum Circuits.Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi
2015Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false).Arturs Backurs, Piotr Indyk
2015Optimal Data-Dependent Hashing for Approximate Near Neighbors.Alexandr Andoni, Ilya P. Razenshteyn
2015Sketching and Embedding are Equivalent for Norms.Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn
2015Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method.Andris Ambainis, Yuval Filmus, Franois Le Gall
2015High Parallel Complexity Graphs and Memory-Hard Functions.Jol Alwen, Vladimir Serbinenko
2015Adjacency Labeling Schemes and Induced-Universal Graphs.Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2015Solving the Shortest Vector Problem in 2Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2015Non-malleable Reductions and Applications.Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
2015Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity.Ittai Abraham, Danny Dolev
2015A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds.Amirali Abdullah, Suresh Venkatasubramanian
2015Matching Triangles and Basing Hardness on an Extremely Popular Conjecture.Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu
2015Reed-Muller Codes for Random Erasures and Errors.Emmanuel Abbe, Amir Shpilka, Avi Wigderson
2015Forrelation: A Problem that Optimally Separates Quantum from Classical Computing.Scott Aaronson, Andris Ambainis
2015The List Decoding Radius of Reed-Muller Codes over Small Fields.Abhishek Bhowmick, Shachar Lovett
2015Approximating the Nash Social Welfare with Indivisible Items.Richard Cole, Vasilis Gkatzelis
2014A characterization of locally testable affine-invariant properties via decomposition theorems.Yuichi Yoshida
2014Faster all-pairs shortest paths via circuit complexity.Ryan Williams
2014New algorithms and lower bounds for circuits with linear threshold gates.Ryan Williams
2014A strongly polynomial algorithm for generalized flow maximization.Lszl A. Vgh
2014From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics.Shay Solomon
2014Entropy, optimization and counting.Mohit Singh, Nisheeth K. Vishnoi
1,6761,700 of 4,576← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.