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
1996Better Lower Bounds for Halfspace Emptiness.Jeff Erickson
1996Approximate Checking of Polynomials and Functional Equations (extended abstract).Funda Ergn, Ravi Kumar, Ronitt Rubinfeld
1996A Decision Procedure for Unitary Linear Quantum Cellular Automata.Christoph Drr, Miklos Santha
1996Median Selection Requires (2+epsilon)n Comparisons.Dorit Dor, Uri Zwick
1996All Pairs Almost Shortest Paths.Dorit Dor, Shay Halperin, Uri Zwick
1996The Optimal Path-Matching Problem.William H. Cunningham, James F. Geelen
1996Universal Data Compression and Portfolio Selection.Thomas M. Cover
1996Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).Joseph Cheriyan, Ramakrishna Thurimella
1996Approximate Option Pricing.Prasad Chalasani, Somesh Jha, Isaac Saias
1996Incoercible Multiparty Computation (extended abstract).Ran Canetti, Rosario Gennaro
1996A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract).Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1996A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions.Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
1996Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security.Mihir Bellare, Ran Canetti, Hugo Krawczyk
1996On the Applications of Multiplicity Automata in Learning.Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
1996Simplified and Improved Resolution Lower Bounds.Paul Beame, Toniann Pitassi
1996Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications.Yair Bartal
1996Fault Tolerant Data Structures.Yonatan Aumann, Michael A. Bender
1996A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems.Sanjeev Arora, Alan M. Frieze, Haim Kaplan
1996Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems.Sanjeev Arora
1996Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles.Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu Zhou
1996Optimal Dynamic Interval Management in External Memory (extended abstract).Lars Arge, Jeffrey Scott Vitter
1996New Algorithms for the Disk Scheduling Problem.Matthew Andrews, Michael A. Bender, Lisa Zhang
1996Universal Stability Results for Greedy Contention-Resolution Protocols.Matthew Andrews, Baruch Awerbuch, Antonio Fernndez, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu
1996Static Dictionaries on ACArne Andersson, Peter Bro Miltersen, Sren Riis, Mikkel Thorup
1996Faster Deterministic Sorting and Searching in Linear Space.Arne Andersson
2,5512,575 of 4,193← PreviousNext →

Comparable venues

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