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
2015Probabilistic Polynomials and Hamming Nearest Neighbors.Josh Alman, Ryan Williams
2015How to Refute a Random CSP.Sarah R. Allen, Ryan O'Donnell, David Witmer
2015Optimal Auctions vs. Anonymous Pricing.Saeed Alaei, Jason D. Hartline, Rad Niazadeh, Emmanouil Pountourakis, Yang Yuan
2015Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again!Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz
2015If the Current Clique Algorithms are Optimal, So is Valiant's Parser.Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
2015Tight Hardness Results for LCS and Other Sequence Similarity Measures.Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
2015Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery.Emmanuel Abbe, Colin Sandon
2014An Automatic Inequality Prover and Instance Optimal Identity Testing.Gregory Valiant, Paul Valiant
2014Shrinkage of De Morgan Formulae by Spectral Techniques.Avishay Tal
2014The Dyck Language Edit Distance Problem in Near-Linear Time.Barna Saha
2014Barriers to Near-Optimal Equilibria.Tim Roughgarden
2014Constructive Discrepancy Minimization for Convex Sets.Thomas Rothvo
2014Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2014Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search.Mihai Patrascu, Mikkel Thorup
2014Settling the APX-Hardness Status for Geometric Set Cover.Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
2014Parallel Repetition from Fortification.Dana Moshkovitz
2014Solving Optimization Problems with Diseconomies of Scale via Decoupling.Konstantin Makarychev, Maxim Sviridenko
2014Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth.Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014Satisfiability and Evolution.Adi Livnat, Christos H. Papadimitriou, Aviad Rubinstein, Gregory Valiant, Andrew Wan
2014On the AC0 Complexity of Subgraph Isomorphism.Yuan Li, Alexander A. Razborov, Benjamin Rossman
2014Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes.Sian-Jheng Lin, Wei-Ho Chung, Yunghsiang S. Han
2014Path Finding Methods for Linear Programming: Solving Linear Programs in (vrank) Iterations and Faster Algorithms for Maximum Flow.Yin Tat Lee, Aaron Sidford
2014O(log log Rank) Competitive Ratio for the Matroid Secretary Problem.Oded Lachish
2014On the Power of Homogeneous Depth 4 Arithmetic Circuits.Mrinal Kumar, Shubhangi Saraf
2014One-Way Functions and (Im)Perfect Obfuscation.Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
1,2011,225 of 4,193← PreviousNext →

Comparable venues

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