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
1983Multiplication Is the Easiest Nontrivial Arithmetic FunctionHelmut Alt
1983Hash Functions for Priority QueuesMikls Ajtai, Michael L. Fredman, Jnos Komls
1983Period-Time Tradeoffs for VLSI Models with Delay (Preliminary Version)Alok Aggarwal
1982Protocols for Secure Computations (Extended Abstract)Andrew Chi-Chih Yao
1982Theory and Applications of Trapdoor Functions (Extended Abstract)Andrew Chi-Chih Yao
1982An Old Linear Programming Algorithm Runs in Polynomial TimeBoris Yamnitsky, Leonid A. Levin
1982A Natural Encoding Scheme Proved Probabilistic Polynomial CompleteUmesh V. Vazirani, Vijay V. Vazirani
1982On Decomposition of Relational DatabasesMoshe Y. Vardi
1982The Ellipsoid Algorithm for Linear Inequalities in Exact ArithmeticSilvio Ursic
1982Generalised Symmetries of Polynomials in Algebraic ComplexityCarl Sturtivant
1982Using Clerks in Parallel ProcessingQuentin F. Stout
1982A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman CryptosystemAdi Shamir
1982Three Applications of Kolmogorov-ComplexityStefan Reisch, Georg Schnitger
1982Parallel Time O(log N) Acceptance of Deterministic CFLsJohn H. Reif
1982On Driving Many Long Lines in a VLSI LayoutVijaya Ramachandran
1982A Temporal Logic to Deal with Fairness in Transition SystemsJean-Pierre Queille, Joseph Sifakis
1982Three Layers Are EnoughFranco P. Preparata, Witold Lipski Jr.
1982Inferring a Sequence Generated by a Linear CongruenceJoan B. Plumstead
1982On-Line Simulation of k+1 Tapes by k Tapes Requires Nonlinear TimeWolfgang J. Paul
1982On the Complexity of Unique SolutionsChristos H. Papadimitriou
1982Generic Transformation of Data StructuresColm 'Dnlaing, Chee-Keng Yap
1982On the Program Size of Perfect and Universal Hash FunctionsKurt Mehlhorn
1982Linear-Time Algorithms for Linear Programming in R^3 and Related ProblemsNimrod Megiddo
1982The Complexity of Compacting Hierarchically Specified Layouts of Integrated Circuits (Preliminary Version)Thomas Lengauer
1982Wafer-Scale Integration of Systolic Arrays (Extended Abstract)Frank Thomson Leighton, Charles E. Leiserson
3,5013,525 of 4,193← PreviousNext →

Comparable venues

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