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
2026Improved Pseudorandom Codes from Permuted Puzzles.Miranda Christ, Noah Golowich, Sam Gunn, Ankur Moitra, Daniel Wichs
2026Approximation Does Not Help in Quantum Unitary Time-Reversal.Kean Chen, Nengkun Yu, Zhicheng Zhang
2026Lower Bounds on Flow Sparsifiers with Steiner Nodes.Yu Chen, Zihan Tan, Mingyang Yang
2026Superquadratic Lower Bounds for Depth-2 Linear Threshold Circuits.Lijie Chen, Avishay Tal, Yichuan Wang
2026A Mysterious Connection between Tolerant Junta Testing and Agnostically Learning Conjunctions.Xi Chen, Shyamal Patel, Rocco A. Servedio
2026A Theory for Probabilistic Polynomial-Time Reasoning.Lijie Chen, Jiatu Li, Igor C. Oliveira, Ryan Williams
2026Secret-Key PIR from Random Linear Codes.Caicai Chen, Yuval Ishai, Tamer Mour, Alon Rosen
2026Computation-Utility-Privacy Tradeoffs in Bayesian Estimation.Sitan Chen, Jingqiu Ding, Mahbod Majid, Walter McKelvie
2026High-Accuracy List-Decodable Mean Estimation.Ziyun Chen, Spencer Compton, Daniel M. Kane, Jerry Li
2026Boolean Function Monotonicity Testing Requires (Almost)Mark Chen, Xi Chen, Hao Cui, William Pires, Jonah Stockwell
2026A Polylogarithmic Approximation for Buy-at-Bulk Network Design with Protection.Chandra Chekuri, Rhea Jain
2026Ttonnement Dynamics for Fisher Markets with Chores.Bhaskar Ray Chaudhury, Christian Kroer, Ruta Mehta, Tianlong Nan
2026Improved Bounds for Coin Flipping, Leader Election, and Random Selection.Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, Rocco A. Servedio
2026Restriction Trees for Sparsity and Applications.Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett
2026Deterministic List Decoding of Reed-Solomon Codes.Soham Chatterjee, Mrinal Kumar, Prahladh Harsha
2026A (4+ϵ)-Approximation for Euclidean k-Means via Non-monotone Dual-Fitting.Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland
2026Cutting Planarians: Planar Emulators for String Graphs.Hsien-Chih Chang, Jonathan Conroy, Zihan Tan, Da Wei Zheng
2026Sparse Linear Regression Is Easy on Random Supports.Gautam Chandrasekaran, Raghu Meka, Konstantinos Stavropoulos
2026A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube.Gautam Chandrasekaran, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan
2026Oracle Subset Problems: A Meta-algorithm for FPT Approximation via Random Walks.Ishan Chakraborty, Tanmay Inamdar, Ariel Kulik, Madhumita Kundu, Saket Saurabh
2026Monotone Circuit Complexity of Matching.Bruno Cavalar, Mika Gs, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
2026Negations Are Powerful Even in Small Depth.Bruno Cavalar, Tho Borm Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff
2026A Meta-complexity Characterization of Minimal Quantum Cryptography.Bruno Cavalar, Boyang Chen, Andrea Coladangelo, Matthew Gray, Zihan Hu, Zhengfeng Ji, Xingjian Li
2026The Sample Complexity of Uniform Approximation for Multi-dimensional CDFs and Fixed-Price Mechanisms.Matteo Castiglioni, Anna Lunghi, Alberto Marchesi
2026Compressed Permutation Oracles.Joseph Carolan
126150 of 4,576← PreviousNext →

Comparable venues

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