ACM Symposium on Theory of Computing

STOC

CORE rank

CORE rank (raw)

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.

Year	Title	Authors
2018	The gram-schmidt walk: a cure for the Banaszczyk blues.	Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
2018	New classes of distributed time complexity.	Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiinen, Dennis Olivetti, Jukka Suomela
2018	The adaptive complexity of maximizing a submodular function.	Eric Balkanski, Yaron Singer
2018	Succinct delegation for low-space non-deterministic computation.	Saikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs
2018	Towards tight approximation bounds for graph diameter and eccentricities.	Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
2018	Clique is hard on average for regular resolution.	Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordstrm, Alexander A. Razborov
2018	Fully dynamic maximal independent set with sublinear update time.	Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	Data-dependent hashing via nonlinear spectral gaps.	Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
2018	Cell-probe lower bounds from online communication complexity.	Josh Alman, Joshua R. Wang, Huacheng Yu
2018	Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing.	Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson
2018	Bootstrapping variables in algebraic circuits.	Manindra Agrawal, Sumanta Ghosh, Nitin Saxena
2018	(Gap/S)ETH hardness of SVP.	Divesh Aggarwal, Noah Stephens-Davidowitz
2018	Fine-grained complexity for sparse graphs.	Udit Agarwal, Vijaya Ramachandran
2018	The art gallery problem is ∃ ℝ-complete.	Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
2018	Fast fencing.	Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
2018	Metric embedding via shortest path decompositions.	Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2018	More consequences of falsifying SETH and the orthogonal vectors conjecture.	Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof
2018	Shadow tomography of quantum states.	Scott Aaronson
2018	Smooth heaps and a dual view of self-adjusting data structures.	Lszl Kozma, Thatchaphol Saranurak
2018	How to match when all vertices arrive online.	Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu
2018	A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes.	Fabrizio Grandoni, Tobias Mmke, Andreas Wiese, Hang Zhou
2018	Counting hypergraph colourings in the local lemma regime.	Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
2018	Improved approximation for tree augmentation: saving by rewiring.	Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen
2018	Holiest minimum-cost paths and flows in surface graphs.	Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren
2017	Recent trends in decentralized cryptocurrencies (invited talk).	Aviv Zohar

1,376–1,400 of 4,576← Previous Next →

Comparable venues

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