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
1996Tree Data Structures for N-Body Simulation.Richard J. Anderson
1996Potential of the Approximation Method (extended abstract).Kazuyuki Amano, Akira Maruoka
1996The Geometry of Coin-Weighing Problems.Noga Alon, Dmitry N. Kozlov, Van H. Vu
1996Polynomial Simulations of Decohered Quantum Computers.Dorit Aharonov, Michael Ben-Or
1996The Boolean Isomorphism Problem.Manindra Agrawal, Thomas Thierauf
1996Binary Search Partitions for Fat Rectangles.Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter
1996New Coding Techniques for Improved Bandwidth Utilization.Micah Adler
1995A Scheduling Model for Reduced CPU Energy.F. Frances Yao, Alan J. Demers, Scott Shenker
1995Perspectives on Database Theory.Mihalis Yannakakis
1995On One-Dimensional Quantum Cellular Automata.John Watrous
1995Cognitive Computation (Extended Abstract).Leslie G. Valiant
1995A Unified Analysis of Paging and Caching.Eric Torng
1995Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time.C. R. Subramanian
1995Faster Approximate Agreement with Multi-Writer Registers.Eric Schenk
1995RSPACE(S) \subseteq DSPACE(SMichael E. Saks, Shiyu Zhou
1995Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems.John H. Reif
1995Pseudorandom Generators, Measure Theory, and Natural Proofs.Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
1995Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines.C. Greg Plaxton
1995Contention Resolution with Bounded Delay.Mike Paterson, Aravind Srinivasan
1995Coding for Computing.Alon Orlitsky, James R. Roche
1995Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking.Chris Okasaki
1995Sparse P-Hard Sets Yield Space-Efficient Algorithms.Mitsunori Ogihara
1995Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version).Noam Nisan, Avi Wigderson
1995Splitters and Near-Optimal Derandomization.Moni Naor, Leonard J. Schulman, Aravind Srinivasan
1995Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions.Moni Naor, Omer Reingold
2,5762,600 of 4,193← PreviousNext →

Comparable venues

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