Skip to content

IEEE Symposium on Foundations of Computer Science

FOCS

A*

CORE rank

CORE rank (raw)

A*

Acceptance rate

30.0% (2023)

Fields of research

Theory of Computation

Papers indexed

4,193

1960–2025

Papers per year

1960142 peak2025

FOCS papers

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

YearTitleAuthors
1979On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract)David P. Dobkin, Lawrence Snyder
1979Orderings for Term-Rewriting SystemsNachum Dershowitz
1979Approximate Algorithms for Optimization of Busy Waiting in Parallel Programs (Preliminary Report)Edmund M. Clarke, Lishing Liu
1979Relativized CryptographyGilles Brassard
1979A Time-Space Tradeoff for Sorting on Non-Oblivious MachinesAllan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1979The Decidability of the Equivalence of Context-Free Grammar FormsMeera Blattner
1979Succinctness, Verifiability and Determinism in Representations of Polynomial-Time LanguagesTheodore P. Baker, Juris Hartmanis
1979Canonical Labelling of Graphs in Linear Average TimeLszl Babai, Ludek Kucera
1979A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per InequalityBengt Aspvall, Yossi Shiloach
1979Random Walks, Universal Traversal Sequences, and the Complexity of Maze ProblemsRomas Aleliunas, Richard M. Karp, Richard J. Lipton, Lszl Lovsz, Charles Rackoff
1979Modeling Communications Protocols by AutomataAlfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
1979Reductions that LieLeonard M. Adleman, Kenneth L. Manders
1979A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract)Leonard M. Adleman
1978On Lifted Problems (Preliminary Reports)Chee-Keng Yap
1978On the Average-case Complexity of Selecting k-th BestAndrew Chi-Chih Yao, F. Frances Yao
1978Should Tables Be Sorted? (Extended Abstract)Andrew Chi-Chih Yao
1978An Optimal Lower Bound on the Number of Total Operations to Compute 0-1 Polynomials over the Field of Complex NumbersJean-Paul Van de Wiele
1978Halting Space-Bounded ComputationsMichael Sipser
1978A Fast Algorithm for Single Processor SchedulingBarbara Simons
1978On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract)Janos Simon, John Gill, James Hunt
1978Limited Subsets of a Free MonoidImre Simon
1978Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version)Rdiger Reischuk
1978On Alternation (Preliminary Version)Wolfgang J. Paul, Ernst-Jrgen Prau, Rdiger Reischuk
1978A Decidability Result for a Second Order Process LogicRohit Parikh
1978Strassen's Algorithm Is not Optimal: Trililnear Technique of Aggregating, Uniting and Canceling for Constructing Fast Algorithms for Matrix OperationsVictor Y. Pan
3,6763,700 of 4,193← PreviousNext →

Comparable venues

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