Skip to content
cs-conference-ranking.org

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

Best Theory of Computation conferences

Papers per year

1969219 peak2026

Most published authors

STOC papers

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

YearTitleAuthors
2025On Approximability of Satisfiable k-CSPs: V.Amey Bhangale, Subhash Khot, Dor Minzer
2025Parallel Repetition for 3-Player XOR Games.Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer
2025Deterministic Dynamic Maximal Matching in Sublinear Update Time.Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2025Computing Moment Polytopes of Tensors, with Applications in Algebraic Complexity and Quantum Information.Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter, Jeroen Zuiddam
2025Matroid Products via Submodular Coupling.Kristf Brczi, Boglrka Gehr, Andrs Imolay, Lszl Lovsz, Balzs Maga, Tams Schwarcz
2025Optimal Non-oblivious Open Addressing.Michael A. Bender, William Kuszmaul, Renfei Zhou
2025Monotone Contractions.Eleni Batziou, John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani
2025Tolerant Testing of Stabilizer States with a Polynomial Gap via a Generalized Uncertainty Relation.Zongbo Bao, Philippe van Dordrecht, Jonas Helsen
2025Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations.Kiril Bangachev, Guy Bresler, Stefan Tiegel, Vinod Vaikuntanathan
2025Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration.Kiril Bangachev, Guy Bresler
2025Matrix Chaos Inequalities and Chaos of Combinatorial Type.Afonso S. Bandeira, Kevin Lucca, Petar Nizic-Nikolac, Ramon van Handel
2025Tensor Concentration Inequalities: A Geometric Approach.Afonso S. Bandeira, Sivakanth Gopi, Haotian Jiang, Kevin Lucca, Thomas Rothvoss
2025Extractors for Samplable Distributions with Low Min-Entropy.Marshall Ball, Ronen Shaltiel, Jad Silbak
2025Distributed Quantum Advantage for Local Problems.Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco d'Amore, Massimo Equi, Franois Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Tendick, Isadora Veeren
2025Learning the Closest Product State.Ainesh Bakshi, John Bostanci, William Kretschmer, Zeph Landau, Jerry Li, Allen Liu, Ryan O'Donnell, Ewin Tang
2025Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity.Mitali Bafna, Karthik C. S., Dor Minzer
2025Constant Degree Networks for Almost-Everywhere Reliable Transmission.Mitali Bafna, Dor Minzer
2025Quasi-Linear Size PCPs with Small Soundness from HDX.Mitali Bafna, Dor Minzer, Nikhil Vyas, Zhiwei Yun
2025Rounding Large Independent Sets on Expanders.Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari
2025Share-Based Fairness for Arbitrary Entitlements.Moshe Babaioff, Uriel Feige
2025Stochastic Matching via In-n-Out Local Computation Algorithms.Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Ronitt Rubinfeld
2025Hardness of 4-Colouring k-Colourable Graphs.Sergey Avvakumov, Marek Filakovsk, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2025History-Independent Concurrent Hash Tables.Hagit Attiya, Michael A. Bender, Martn Farach-Colton, Rotem Oshman, Noa Schiller
2025Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets.Albert Atserias, Iddo Tzameret
2025Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms.Sepehr Assadi, Sanjeev Khanna, Aaron Putterman
376–400 of 4,576← PreviousNext →

Comparable venues

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