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
1990Uniform Memory HierarchiesBowen Alpern, Larry Carter, Ephraim Feig
1990Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract)Noga Alon, Moni Naor
1990Parallel Linear Programming in Fixed Dimension Almost Surely in Constant TimeNoga Alon, Nimrod Megiddo
1990Simple Constructions of Almost k-Wise Independent Random VariablesNoga Alon, Oded Goldreich, Johan Hstad, Ren Peralta
1990A Markovian Extension of Valiant's Learning Model (Extended Abstract)David J. Aldous, Umesh V. Vazirani
1990A Time-Space Tradeoff for Boolean Matrix MultiplicationKarl R. Abrahamson
1989Lower Bounds for Algebraic Computation Trees with Integer InputsAndrew Chi-Chih Yao
1989A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract)Pravin M. Vaidya
1989Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract)Pravin M. Vaidya
1989The Equivalence and Learning of Probabilistic Automata (Extended Abstract)Wen-Guey Tzeng
1989On the Computational Power of PP and +PSeinosuke Toda
1989Twists, Turns, Cascades, Deque Conjecture, and Scanning TheoremRajamani Sundar
1989On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract)Alan Siegel
1989The Strength of Weak Learnability (Extended Abstract)Robert E. Schapire
1989Full Abstraction for Nondeterministic Dataflow NetworksJames R. Russell
1989Galois Groups and Factoring Polynomials over Finite FieldsLajos Rnyai
1989Probabilistic Communication Complexity of Boolean Relations (Extended Abstract)Ran Raz, Avi Wigderson
1989An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract)Vijaya Ramachandran, John H. Reif
1989On the Network Complexity of SelectionC. Greg Plaxton
1989An Upper Bound on the Number of Planar k-SetsJnos Pach, William L. Steiger, Endre Szemerdi
1989The 0-1 Law Fails for the Class of Existential Second Order Gdel Sentences with EqualityLeszek Pacholski, Wieslaw Szwast
1989Output-Sensitive Hidden Surface RemovalMark H. Overmars, Micha Sharir
1989Lower Bounds for the Stable Marriage Problem and its VariantsCheng Ng
1989On Obstructions in Relation to a Fixed ViewpointKetan Mulmuley
1989The Probabilistic Method Yields Deterministic Parallel AlgorithmsRajeev Motwani, Joseph Naor, Moni Naor
3,0513,075 of 4,193← PreviousNext →

Comparable venues

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