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 |
|---|---|---|
| 2014 | Analytical approach to parallel repetition. | Irit Dinur, David Steurer |
| 2014 | Satisfiability threshold for random regular NAE-SAT. | Jian Ding, Allan Sly, Nike Sun |
| 2014 | Efficient deterministic approximate counting for low-degree polynomial threshold functions. | Anindya De, Rocco A. Servedio |
| 2014 | Bandits with switching costs: | Ofer Dekel, Jian Ding, Tomer Koren, Yuval Peres |
| 2014 | From average case complexity to improper learning complexity. | Amit Daniely, Nati Linial, Shai Shalev-Shwartz |
| 2014 | Minimum bisection is fixed parameter tractable. | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2014 | Infinite randomness expansion with a constant number of devices. | Matthew Coudron, Henry Yuen |
| 2014 | The sample complexity of revenue maximization. | Richard Cole, Tim Roughgarden |
| 2014 | The asymptotic k-SAT threshold. | Amin Coja-Oghlan |
| 2014 | Solving SDD linear systems in nearly | Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu |
| 2014 | Online local learning via semidefinite programming. | Paul F. Christiano |
| 2014 | Optimal competitive auctions. | Ning Chen, Nick Gravin, Pinyan Lu |
| 2014 | Shortest paths on polyhedral surfaces and terrains. | Siu-Wing Cheng, Jiongxin Jin |
| 2014 | Polynomial bounds for the grid-minor theorem. | Chandra Chekuri, Julia Chuzhoy |
| 2014 | Approximate distance oracles with constant query time. | Shiri Chechik |
| 2014 | Efficient density estimation via piecewise polynomial approximation. | Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun |
| 2014 | Fingerprinting codes and the price of approximate differential privacy. | Mark Bun, Jonathan R. Ullman, Salil P. Vadhan |
| 2014 | Computing with a full memory: catalytic space. | Harry Buhrman, Richard Cleve, Michal Kouck, Bruno Loff, Florian Speelman |
| 2014 | Homological product codes. | Sergey Bravyi, Matthew B. Hastings |
| 2014 | Optimal CUR matrix decompositions. | Christos Boutsidis, David P. Woodruff |
| 2014 | On the existence of extractable one-way functions. | Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen |
| 2014 | Smoothed analysis of tensor decompositions. | Aditya Bhaskara, Moses Charikar, Ankur Moitra, Aravindan Vijayaraghavan |
| 2014 | Exponential improvement in precision for simulating sparse Hamiltonians. | Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma |
| 2014 | L | Piotr Berman, Sofya Raskhodnikova, Grigory Yaroslavtsev |
| 2014 | Coin flipping of | Itay Berman, Iftach Haitner, Aris Tentes |
1,751–1,775 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