Skip to content

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

STOC papers

4,576 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1992Ray Shooting and Parametric SearchPankaj K. Agarwal, Jir Matousek
1992Polynomial Algorithms for Linear Programming over the Algebraic NumbersIlan Adler, Peter A. Beling
1991Testing Finite State Machines (Extended Abstract)Mihalis Yannakakis, David Lee
1991Separating Concurrent Languages with Categories of Language Embeddings (Extended Abstract)Ehud Shapiro
1991Rounds in Communication Complexity RevisitedNoam Nisan, Avi Wigderson
1991Lower Bounds for Non-Commutative Computation (Extended Abstract)Noam Nisan
1991Hidden Surface Removal with Respect to a Moving View PointKetan Mulmuley
1991Reducing Elliptic Curve Logarithms to Logarithms in a Finite FieldAlfred Menezes, Scott A. Vanstone, Tatsuaki Okamoto
1991Perfect Cryptographic Security from Partially Independent ChannelsUeli M. Maurer
1991Approximations and Optimal Geometric Divide-And-ConquerJir Matousek
1991Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract)Yossi Matias, Uzi Vishkin
1991On Deterministic Approximation of DNFMichael Luby, Boban Velickovic
1991On-Line Learning of Linear FunctionsNick Littlestone, Philip M. Long, Manfred K. Warmuth
1991Fast Approximation Algorithms for Multicommodity Flow ProblemsFrank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, va Tardos, Spyros Tragoudas
1991Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract)Eyal Kushilevitz, Yishay Mansour
1991Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract)Ker-I Ko
1991A General Completeness Theorem for Two-Party GamesJoe Kilian
1991Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract)Zvi M. Kedem, Krishna V. Palem, A. Raghunathan, Paul G. Spirakis
1991Probabilistic Recurrence RelationsRichard M. Karp
1991Lower Bounds for Randomized k-Server and Motion Planning AlgorithmsHoward J. Karloff, Yuval Rabani, Yiftach Ravid
1991Effective Noether Irreducibility Forms and Applications (Extended Abstract)Erich L. Kaltofen
1991A Model for Data in MotionSimon Kahan
1991Hamiltonian Paths in Infinite GraphsDavid Harel
1991Constant-Time Parallel Integer Sorting (Extended Abstract)Torben Hagerup
1991The Harmonic Online K-Server Algorithm Is CompetitiveEdward F. Grove
3,6013,625 of 4,576← PreviousNext →

Comparable venues

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