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
Most published authors
STOC papers
4,576 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2022 | Towards optimal lower bounds for k-median and k-means coresets. | Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn |
| 2022 | Improved approximations for Euclidean | Vincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan |
| 2022 | Bypassing the surface embedding: approximation schemes for network design in minor-free graphs. | Vincent Cohen-Addad |
| 2022 | A subpolynomial approximation algorithm for graph crossing number in low-degree graphs. | Julia Chuzhoy, Zihan Tan |
| 2022 | Linear space streaming lower bounds for approximating CSPs. | Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy |
| 2022 | Faster min-plus product for monotone instances. | Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang |
| 2022 | Uniform approximations for Randomized Hadamard Transforms with applications. | Yeshwanth Cherapanamjeri, Jelani Nelson |
| 2022 | On the complexity of dynamic submodular maximization. | Xi Chen, Binghui Peng |
| 2022 | Kalman filtering with adversarial corruptions. | Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau |
| 2022 | New streaming algorithms for high dimensional EMD and MST. | Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten |
| 2022 | Extractors for sum of two sources. | Eshan Chattopadhyay, Jyun-Jie Liao |
| 2022 | Approximate polymorphisms. | Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh |
| 2022 | Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. | Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2022 | Almost-linear | Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan |
| 2022 | Edge connectivity augmentation in near-linear time. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2022 | Computational thresholds for the fixed-magnetization Ising model. | Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins |
| 2022 | On the complexity of CSP-based ideal membership problems. | Andrei A. Bulatov, Akbar Rafiey |
| 2022 | Complexity classification of counting graph homomorphisms modulo a prime number. | Andrei A. Bulatov, Amirhossein Kazeminia |
| 2022 | Almost-optimal sublinear-time edit distance in the low distance regime. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos |
| 2022 | Sublinear time spectral density estimation. | Vladimir Braverman, Aditya Krishnan, Christopher Musco |
| 2022 | Faster maxflow via improved dynamic spectral vertex sparsifiers. | Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford |
| 2022 | Quantum garbled circuits. | Zvika Brakerski, Henry Yuen |
| 2022 | Twin-width IV: ordered graphs and matrices. | douard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stphan Thomass, Szymon Torunczyk |
| 2022 | The query complexity of certification. | Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan |
| 2022 | The shortest even cycle problem is tractable. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski |
851–875 of 4,576← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing
- AALENEXWorkshop on Algorithm Engineering and Experiments