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 |
|---|---|---|
| 2026 | A Graph Minors Approach to Temporal Sequences. | Johannes Carmesin, Will J. Turner |
| 2026 | Provable Long-Range Benefits of Next-Token Prediction. | Xinyuan Cao, Santosh S. Vempala |
| 2026 | New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model. | Jin-Yi Cai, Austen Z. Fan, Shuai Shao, Zhuxiao Tang |
| 2026 | Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games. | Yang Cai, Constantinos Daskalakis, Haipeng Luo, Chen-Yu Wei, Weiqiang Zheng |
| 2026 | Contention Resolution, with and without a Global Clock. | Zixi Cai, Kuowen Chen, Shengquan Du, Tsvi Kopelowitz, Seth Pettie, Ben Plosk |
| 2026 | Testing Distributions against Bounded Distinguishers. | Mark Bun, Rathin Desai, Renato Ferreira Pinto Jr. |
| 2026 | Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling. | Karl Bringmann, Anita Drr, Karol Wegrzycki |
| 2026 | An Optimal Algorithm for Stochastic Vertex Cover. | Jan van den Brand, Inge Li Grtz, Chirag Pabbaraju, Debmalya Panigrahi, Clifford Stein, Miltiadis Stouras, Ola Svensson, Ali Vakilian |
| 2026 | Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2026 | From Random to Explicit via Subspace Designs with Applications to Local Properties and Matroids. | Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang |
| 2026 | Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities. | Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang |
| 2026 | Combinatorial Markov Search. | Robin Bowers, Elias Lindgren, Bo Waggoner |
| 2026 | Separating QMA from QCMA with a Classical Oracle. | John Bostanci, Jonas Haferkamp, Chinmay Nirkhe, Mark Zhandry |
| 2026 | Separator Theorem for Minor-Free Graphs in Linear Time. | douard Bonnet, Tuukka Korhonen, Hung Le, Jason Li, Toms Masark |
| 2026 | Adaptive Robustness of Hypergrid Johnson-Lindenstrauss. | Andrej Bogdanov, Alon Rosen, Neekon Vafa, Vinod Vaikuntanathan |
| 2026 | Average Hardness of SIVP for Module Lattices of Fixed Rank. | Koen de Boer, Aurel Page, Radu Toma, Benjamin Wesolowski |
| 2026 | Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces. | Ari Blondal, Hamed Hatami, Pooya Hatami, Chavdar Lalov, Sivan Tretiak |
| 2026 | What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing. | Llia Blin, Fedor V. Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2026 | Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-uniform k-Center. | Jannis Blauth, Christian Nbel, Rico Zenklusen |
| 2026 | A Constant-Factor Approximation for Directed Latency. | Jannis Blauth, Ramin Mousavi |
| 2026 | Fine-Grained Complexity of Continuous Euclidean k-Center. | Lotte Blank, Karl Bringmann, Parinya Chalermsook, Karthik C. S., Benedikt Kolbe, Hung Le, Geert van Wordragen |
| 2026 | Determination of the Fifth Busy Beaver Value. | Justin Blanchard, Daniel Briggs, Konrad Deka, Nathan Fenner, Yannick Forster, Georgi Georgiev (Skelet), Matthew L. House, Maja Kadziolka, Pavel Kropitz, Shawn Ligocki, mxdys, Mateusz Nasciszewski, Tristan Strin, Chris Xu, Jason Yuen, Tho Zimmermann |
| 2026 | Shuffling Is Universal: Statistical Additive Randomized Encodings for All Functions. | Nir Bitansky, Saroja Erabelli, Rachit Garg, Yuval Ishai |
| 2026 | Space-Efficient Text Indexing with Mismatches using Function Inversion. | Jackson Bibbens, Levi Borevitz, Samuel McCauley |
| 2026 | Additive One Approximation for Minimum Degree Spanning Tree: Breaking the O(mn) Time Barrier. | Sayan Bhattacharya, Ermiya Farokhnejad, Haoze Wang |
151–175 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