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
2007On the Hardness and Smoothed Complexity of Quasi-Concave Minimization.Jonathan A. Kelner, Evdokia Nikolova
2007Sparse Random Linear Codes are Locally Decodable and Testable.Tali Kaufman, Madhu Sudan
2007Balloon Popping With Applications to Ascending Auctions.Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Kunal Talwar
2007Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling.Philipp Hertel, Toniann Pitassi
2007Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2007Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards.Sudipto Guha, Kamesh Munagala
2007Hardness of Reconstructing Multivariate Polynomials over Finite Fields.Parikshit Gopalan, Subhash Khot, Rishi Saket
2007Reconstruction for Models on Random Graphs.Antoine Gerschenfeld, Andrea Montanari
2007Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovsz-Schrijver Hierarchy.Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis
2007Minimizing Average Flow-time: Upper and Lower Bounds.Naveen Garg, Amit Kumar
2007Round Complexity of Authenticated Broadcast with a Dishonest Majority.Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky
2007Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.Anna Gl, Parikshit Gopalan
2007Approximate Hypergraph Partitioning and Applications.Eldar Fischer, Arie Matsliah, Asaf Shapira
2007Maximizing Non-Monotone Submodular Functions.Uriel Feige, Vahab S. Mirrokni, Jan Vondrk
2007Refuting Smoothed 3CNF Formulas.Uriel Feige
2007Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions.Esther Ezra, Micha Sharir
2007On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract).Kousha Etessami, Mihalis Yannakakis
2007Intrusion-Resilient Secret Sharing.Stefan Dziembowski, Krzysztof Pietrzak
2007Extractors and Rank Extractors for Polynomial Sources.Zeev Dvir, Ariel Gabizon, Avi Wigderson
2007Testing for Concise Representations.Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan
2007Computing Equilibria in Anonymous Games.Constantinos Daskalakis, Christos H. Papadimitriou
2007Parameterized Proof Complexity.Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
2007Testing Expansion in Bounded-Degree Graphs.Artur Czumaj, Christian Sohler
2007Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations.Eden Chlamtac
2007Quantum Algorithms for Hidden Nonlinear Structures.Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani
1,7761,800 of 4,193← PreviousNext →

Comparable venues

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