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
2006Lower bounds for circuits with MOD_m gates.Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlk, Denis Thrien
2006Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry.Timothy M. Chan
2006New Limits on Fault-Tolerant Quantum Computation.Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger
2006Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach.Niv Buchbinder, Joseph Naor
2006The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels.Christian Borgs, Jennifer T. Chayes, Elchanan Mossel, Sbastien Roch
2006Inclusion--Exclusion Algorithms for Counting Set Partitions.Andreas Bjrklund, Thore Husfeldt
2006Subspace Polynomials and List Decoding of Reed-Solomon Codes.Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
2006Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority.Michael Ben-Or, Claude Crpeau, Daniel Gottesman, Avinatan Hassidim, Adam D. Smith
2006Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body.Mikhail Belkin, Hariharan Narayanan, Partha Niyogi
2006Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources.Nadine Baumann, Martin Skutella
2006Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths.Surender Baswana, Telikepalli Kavitha
2006Concurrent Non-Malleable Zero Knowledge.Boaz Barak, Manoj Prabhakaran, Amit Sahai
2006Index Coding with Side Information.Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol
2006Improved approximation algorithms for multidimensional bin packing problems.Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
2006Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method.David Arthur, Sergei Vassilvitskii
2006Improved Dynamic Planar Point Location.Lars Arge, Gerth Stlting Brodal, Loukas Georgiadis
2006Strategic Network Formation through Peering and Service Agreements.Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong
2006On the Optimality of the Dimensionality Reduction Method.Alexandr Andoni, Piotr Indyk, Mihai Patrascu
2006Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions.Alexandr Andoni, Piotr Indyk
2006Local Graph Partitioning using PageRank Vectors.Reid Andersen, Fan R. K. Chung, Kevin J. Lang
2006On the Impact of Combinatorial Structure on Congestion Games.Heiner Ackermann, Heiko Rglin, Berthold Vcking
2005Answering distance queries in directed graphs using fast matrix multiplication.Raphael Yuster, Uri Zwick
2005FOCS 2005 - Copyright.
2005Corporate Sponsors.
2005Reviewers.
1,8761,900 of 4,193← PreviousNext →

Comparable venues

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