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
1983Reliable Computation with Cellular AutomataPter Gcs
1983A Linear-Time Algorithm for a Special Case of Disjoint Set UnionHarold N. Gabow, Robert Endre Tarjan
1983An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow ProblemsHarold N. Gabow
1983Normal Forms for Trivalent Graphs and Graphs of Bounded ValenceMartin Frer, Walter Schnyder, Ernst Specker
1983Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version)Greg N. Frederickson
1983New Bounds for Parallel Prefix CircuitsFaith E. Fich
1983A Decidable Propositional Probabilistic Dynamic LogicYishai A. Feldman
1983Iterated Pushdown Automata and Complexity ClassesJoost Engelfriet
1983Speedups of Deterministic Machines by Synchronous Parallel MachinesPatrick W. Dymond, Martin Tompa
1983Two Nonlinear Lower BoundsPavol Duris, Zvi Galil, Wolfgang J. Paul, Rdiger Reischuk
1983On the Diameter of Permutation GroupsJames R. Driscoll, Merrick L. Furst
1983Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version)Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson
1983Multi-Party ProtocolsAshok K. Chandra, Merrick L. Furst, Richard J. Lipton
1983Unbounded Fan-in Circuits and Associative FunctionsAshok K. Chandra, Steven Fortune, Richard J. Lipton
1983Bounds for Width Two Branching ProgramsAllan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul
1983How to Exchange (Secret) Keys (Extended Abstract)Manuel Blum
1983On the Cryptographic Security of Single RSA BitsMichael Ben-Or, Benny Chor, Adi Shamir
1983Lower Bounds for Algebraic Computation Trees (Preliminary Report)Michael Ben-Or
1983An Approximation Algorithm for Manhattan Routing (Extended Abstract)Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton
1983How to Generate Random Integers with Known FactorizationEric Bach
1983Canonical Labeling of GraphsLszl Babai, Eugene M. Luks
1983An O(n log n) Sorting NetworkMikls Ajtai, Jnos Komls, Endre Szemerdi
1983On Notions of Information Transfer in VLSI CircuitsAlfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
1983On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract)Leonard M. Adleman
1982Space-Time Tradeoff for Answering Range Queries (Extended Abstract)Andrew Chi-Chih Yao
4,0764,100 of 4,576← PreviousNext →

Comparable venues

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