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
2023Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted Eigenvalues.Lap Chi Lau, Kam Chuen Tung, Robert Wang
2023Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse.Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana
2023Quantum Cryptography in Algorithmica.William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal
2023An Improved Parameterized Algorithm for Treewidth.Tuukka Korhonen, Daniel Lokshtanov
2023Boosting Batch Arguments and RAM Delegation.Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs
2023Quantum Advantage from Any Non-local Game.Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang
2023Sum-of-Squares Lower Bounds for Densest k-Subgraph.Chris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu
2023Removing Additive Structure in 3SUM-Based Reductions.Ce Jin, Yinzhan Xu
2023Finding a Small Vertex Cut on Distributed Networks.Yonggang Jiang, Sagnik Mukhopadhyay
2023The Power of Unentangled Quantum Proofs with Non-negative Amplitudes.Fernando Granha Jeronimo, Pei Wu
2023Multidimensional Quantum Walks.Stacey Jeffery, Sebastian Zur
2023Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification.Arun Jambulapati, Yang P. Liu, Aaron Sidford
2023Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic.Rahul Ilango, Jiatu Li, R. Ryan Williams
2023Uniformly Random Colourings of Sparse Graphs.Eoin Hurley, Franois Pirot
2023Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method.Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang
2023Tight Conditional Lower Bounds for Vertex Connectivity Problems.Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang
2023NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach.Yizhi Huang, Rahul Ilango, Hanlin Ren
2023Robustness Implies Privacy in Statistical Estimation.Samuel B. Hopkins, Gautam Kamath, Mahbod Majid, Shyam Narayanan
2023Hardness Self-Amplification: Simplified, Optimized, and Unified.Shuichi Hirahara, Nobutaka Shimizu
2023A Duality between One-Way Functions and Average-Case Symmetry of Information.Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira
2023Capturing One-Way Functions via NP-Hardness of Meta-Complexity.Shuichi Hirahara
2023Approximating Binary Longest Common Subsequence in Almost-Linear Time.Xiaoyu He, Ray Li
2023Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees.Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell
2023A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications.Hamed Hatami, Kaave Hosseini, Xiang Meng
2023Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast.Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak
651675 of 4,576← PreviousNext →

Comparable venues

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