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
1980The Consistency of "P = NP" and Related Problems with Fragments of Number Theory.Richard A. DeMillo, Richard J. Lipton
1980An Approach to The k Paths ProblemAllen Cypher
1980Detection is Easier than Computation (Extended Abstract)Bernard Chazelle, David P. Dobkin
1980Graph Pebbling with Many Free Pebbles can be DifficultDavid A. Carlson, John E. Savage
1980Kraft Storage and Access for List Implementations (Extended Abstract)Donna J. Brown
1980The Chip Complexity of Binary ArithmeticRichard P. Brent, H. T. Kung
1980A Time-Space Tradeoff for Sorting on a General Sequential Model of ComputationAllan Borodin, Stephen A. Cook
1980A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n)Peter A. Bloniarz
1980Local and Global Properties in Networks of Processors (Extended Abstract)Dana Angluin
1979Some Complexity Questions Related to Distributive Computing (Preliminary Report)Andrew Chi-Chih Yao
1979Completeness Classes in AlgebraLeslie G. Valiant
1979Negation Can Be Exponentially PowerfulLeslie G. Valiant
1979The recognition of Series Parallel digraphsJacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler
1979Deadlock-Free Packet Switching NetworksSam Toueg, Jeffrey D. Ullman
1979Area-Time Complexity for VLSIClark D. Thompson
1979Lower Bounds on the Size of Sweeping AutomataMichael Sipser
1979On the Cryptocomplexity of Knapsack SystemsAdi Shamir
1979The Complexity of Finding PeriodsRobert Sedgewick, Thomas G. Szymanski
1979Tree-Size Bounded AlternationWalter L. Ruzzo
1979Storage Representations for Tree-Like Data StructuresArnold L. Rosenberg, Derick Wood, Zvi Galil
1979Universal Games of Incomplete InformationJohn H. Reif
1979Time-Space Trade-Offs for Asynchronous Parallel Models: Reducibilities and EquivalencesGary L. Peterson
1979A Programming Language Theorem Which Is Independent of Peano ArithmeticMichael J. O'Donnell
1979Implicit Data Structures (Preliminary Draft)J. Ian Munro, Hendra Suwanda
1979On the Expressive Power of Dynamic Logic (Preliminary Report)Albert R. Meyer, Karl Winklmann
4,2264,250 of 4,576← PreviousNext →

Comparable venues

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