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 |
|---|---|---|
| 2018 | A friendly smoothed analysis of the simplex method. | Daniel Dadush, Sophie Huiberts |
| 2018 | Round compression for parallel matching algorithms. | Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2018 | Explicit binary tree codes with polylogarithmic size alphabet. | Gil Cohen, Bernhard Haeupler, Leonard J. Schulman |
| 2018 | Almost polynomial hardness of node-disjoint paths in grids. | Julia Chuzhoy, David H. K. Kim, Rachit Nimavat |
| 2018 | Universal points in the asymptotic spectrum of tensors. | Matthias Christandl, Pter Vrana, Jeroen Zuiddam |
| 2018 | Capacity upper bounds for deletion-type channels. | Mahdi Cheraghchi |
| 2018 | Simulation beats richness: new data-structure lower bounds. | Arkadev Chattopadhyay, Michal Kouck, Bruno Loff, Sagnik Mukhopadhyay |
| 2018 | Improved pseudorandomness for unordered branching programs through local monotonicity. | Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal |
| 2018 | An optimal distributed (Δ+1)-coloring algorithm? | Yi-Jun Chang, Wenzheng Li, Seth Pettie |
| 2018 | Tight cell probe bounds for succinct Boolean matrix-vector multiplication. | Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen |
| 2018 | Testing conditional independence of discrete distributions. | Clment L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart |
| 2018 | Constant-factor approximation for ordered k-median. | Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase |
| 2018 | The polynomial method strikes back: tight quantum query bounds via dual polynomials. | Mark Bun, Robin Kothari, Justin Thaler |
| 2018 | Composable and versatile privacy via truncated CDP. | Mark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke |
| 2018 | k-server via multiscale entropic regularization. | Sbastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee, Aleksander Madry |
| 2018 | An homotopy method for l | Sbastien Bubeck, Michael B. Cohen, Yin Tat Lee, Yuanzhi Li |
| 2018 | Interactive compression to external information. | Mark Braverman, Gillat Kol |
| 2018 | Hitting sets with near-optimal error for read-once branching programs. | Mark Braverman, Gil Cohen, Sumegha Garg |
| 2018 | Extensor-coding. | Cornelius Brand, Holger Dell, Thore Husfeldt |
| 2018 | General strong polarization. | Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan |
| 2018 | Generalized matrix completion and algebraic natural proofs. | Markus Blser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov |
| 2018 | Multi-collision resistance: a paradigm for keyless hash functions. | Nir Bitansky, Yael Tauman Kalai, Omer Paneth |
| 2018 | Inapproximability of the independent set polynomial in the complex plane. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2018 | A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak, Dniel Marx, Tom C. van der Zanden |
| 2018 | Fast algorithms for knapsack via convolution and prediction. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein |
1,351–1,375 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