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
1973Automatic Theorem-Proving and the Decision ProblemWilliam H. Joyner Jr.
1973Characterizations of LR(0) Languages (Extended Abstract)Matthew M. Geller, Michael A. Harrison
1973Equivalence Problems in Monadic Recursion SchemesEmily P. Friedman
1973Graph-Grammars: An Algebraic ApproachHartmut Ehrig, Michael Pfender, Hans Jrgen Schneider
1973On the Optimal Evaluation of a Set of n-Linear FormsDavid P. Dobkin
1973Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-FlopsHenry Y. H. Chuang, Santanu Das
1973The Complexity of Some Non-Classical LogicsJohn C. Cherniavsky
1973Efficient Compilation of Linear Recursive ProgramsAshok K. Chandra
1973Mechanizable Proofs about Parallel ProcessesJean-Marie Cadiou, Jean-Jacques Lvy
1973On Multiple Input Change Hazard-Free Combinatorial Switching Circuits without FeedbackJon G. Bredeson
1973Inductive Inference: A Recursion Theoretic ApproachLenore Blum, Manuel Blum
1973Chow Parameters in Pseudothreshold LogicCharles R. Baugh
1972A Fast Algorithm for the Elimination of Common SubexpressionsJeffrey D. Ullman
1972Some Results in Computational TopologyGeorge Tourlakis, John Mylopoulos
1972On the Number of Multiplications for the Evaluation of a Polynomial and All Its DerivativesMary Shaw, Joseph F. Traub
1972Multiple Faults in Reed-Muller Canonic NetworksKewal K. Saluja, Sudhakar M. Reddy
1972Some Related Problems from Network Flows, Game Theory and Integer ProgrammingSartaj Sahni
1972Program Equivalence and Context-Free GrammarsBarry K. Rosen
1972On the Relation of Graph Grammars and Graph AutomataJohn Mylopoulos
1972Fast Modular Transforms via DivisionR. Moenck, Allan Borodin
1972The Equivalence Problem for Regular Expressions with Squaring Requires Exponential SpaceAlbert R. Meyer, Larry J. Stockmeyer
1972Honest Bounds for Complexity Classes of Recursive FunctionsAlbert R. Meyer, Robert Moll
1972The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular SetsT. S. E. Maibaum
1972Renamings in Program Schemas (Extended Abstract)Luigi Logrippo
1972Optimal Scheduling on Multi-Processor Computing SystemsC. L. Liu
3,8513,875 of 4,193← PreviousNext →

Comparable venues

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