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
1998Jitter Control in QoS Networks.Yishay Mansour, Boaz Patt-Shamir
1998A Characterization of NC by Tree Recurrence.Daniel Leivant
1998Recommendation Systems: A Probabilistic Analysis.Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
1998Lower Bounds for Zero Knowledge on the Internet.Joe Kilian, Erez Petrank, Charles Rackoff
1998Theoretical Issues in Probabilistic Artificial Intelligence.Michael J. Kearns
1998Local Search in Smooth Convex Sets.Ravi Kannan, Andreas Nolte
1998Orchestrating Quartets: Approximation and Data Correction.Tao Jiang, Paul E. Kearney, Ming Li
1998Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem.Kamal Jain
1998Faster Algorithms for String Matching Problems: Matching the Convolution Bound.Piotr Indyk
1998On Approximate Nearest Neighbors in Non-Euclidean Spaces.Piotr Indyk
1998Randomness vs. Time: De-Randomization under a Uniform Assumption.Russell Impagliazzo, Avi Wigderson
1998Which Problems Have Strongly Exponential Complexity?Russell Impagliazzo, Ramamohan Paturi, Francis Zane
1998The Security of Individual RSA Bits.Johan Hstad, Mats Nslund
1998Satisfiability of Word Equations with Constants is in Exponential Space.Claudio Gutierrez
1998Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes.Venkatesan Guruswami, Madhu Sudan
1998A Tight Characterization of NP with 3 Query PCPs.Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan
1998Lower Bounds for (MOD p - MOD m) Circuits.Vince Grolmusz, Gbor Tardos
1998Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields.Dima Grigoriev, Alexander A. Razborov
1998Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs.Dima Grigoriev
1998The Complexity of Acyclic Conjunctive Queries.Georg Gottlob, Nicola Leone, Francesco Scarcello
1998Testing Monotonicity.Oded Goldreich, Shafi Goldwasser, Eric P. Lehman, Dana Ron
1998Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems.Naveen Garg, Jochen Knemann
1998Stability of Adversarial Queues via Fluid Models.David Gamarnik
1998Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations.Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
1998Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs.Uriel Feige, Joe Kilian
2,4012,425 of 4,193← PreviousNext →

Comparable venues

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