Conference Information

FOCS 2026: IEEE Symposium on Foundations of Computer Science

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Submission Date:
2026-04-01
Notification Date:
2026-07-03
Conference Date:
2026-11-08
Location:
New York City, New York, USA
Years:
Add to calendar: Outlook / Apple (.ics)
CCF: A   ICORE: A*   QUALIS: A1   Viewed: 278996   Tracked: 50   Attend: 6
Something wrong with this page? Tell us
Embed deadline badge
FOCS
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.

Conference Partner Index (CP-I)

91.3 / 100
Ranked #55 of 5,697 conferences · Top 1%

#3 of 142 in Theory & Algorithms

Academic recognition (35%)
100
Submission selectivity (20%)
80
Editions held (20%)
100
Community attention (10%)
54
Public record completeness (15%)
100

Inputs used: Listed as CCF A, QUALIS A1 · Acceptance rate: 28.6% (mean of 5 editions on file) · Editions on record: 67 · Researchers following it here: 50 · Researchers who opened this page in the past 24 months: 7

Confidence 100% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-10-12

Call For Papers

FOCS 2026 (IEEE Symposium on Foundations of Computer Science) is a CCF A / ICORE A* / QUALIS A1 conference held in New York City, New York, USA on 2026-11-08. The paper submission deadline is 2026-04-01. Acceptance notifications are sent on 2026-07-03.

The 67th Annual Symposium on Foundations of Computer Science (FOCS 2026), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held in New York, USA, November 8–11, 2026. Information about previous conferences can be found at the FOCS Conference Archive. Papers presenting new and original research on theory of computation are sought. Typical but not exclusive topics of interest include: Algebraic computation Algorithmic coding theory Algorithmic game theory Algorithmic graph theory Algorithms and data structures Analysis of Boolean functions Approximation algorithms Average-case algorithms and complexity Circuit complexity Combinatorial optimization Combinatorics and graph theory Communication complexity Computational applications of logic Computational complexity Computational geometry Computational learning theory Continuous optimization Cryptography Dynamic algorithms Foundations of fairness and privacy Foundations of machine learning Online algorithms Parallel and distributed algorithms Parameterized algorithms Pseudorandomness and derandomization Quantum computing Randomization and probabilistic method Spectral algorithms Streaming algorithms Sublinear time algorithms Theoretical aspects of networking, information retrieval, computational biology, and databases Papers that broaden the reach of the theory of computing or raise important problems benefiting from theoretical investigation are encouraged.
Last updated by Admin Agent on

Acceptance Ratio

Average acceptance rate: 28% over 16 years (2005–2020).

YearSubmittedAcceptedAccepted(%)
202039912731.8%
20193189228.9%
20183208626.9%
20173239027.9%
20163078527.7%
20153148627.4%
20142736824.9%
20132817928.1%
20122487931.9%
20112928529.1%
20102708130%
20092497530.1%
20082767928.6%
20073026621.9%
20062407129.6%
20052726222.8%

Best Papers

YearBest Papers
2025Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest
2025Quasipolynomial bounds for the corners theorem
2025Explicit Lossless Vertex Expanders
2024Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
2024Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
2023The Subspace Flatness Conjecture and Faster Integer Programming
2023Strong Bounds for 3-Progressions
2022Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
2022Negative-Weight Single-Source Shortest Paths in Near-Linear Time
2021Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
2020An Equivalence Between Private Classification and Online Prediction
2020Edge-Weighted Online Bipartite Matching
2020A New Minimax Theorem for Randomized Algorithms
2019Faster Minimum k-cut of a Simple Graph
2019Efficient Construction of Rigid Matrices Using an NP Oracle
2019Automating Resolution is NP-Hard
2019NEEXP ⊆ MIP*
2019Lower bounds for maximal matchings and maximal independent sets
2018Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion
2018Classical Verification of Quantum Computation
2018Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time
2017The Proof of CSP Dichotomy Conjecture
2017The Matching Problem in General Graphs is in Quasi-NC
2017A dichotomy theorem for nonuniform CSPs
2016Settling the Complexity of Computing Approximate Two-Player Nash Equilibria
2016Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning
2015An average-case depth hierarchy theorem for Boolean circuits
2014Path Finding Methods for Linear Programming: Solving Linear Programs in O(sqrt(rank)) Iterations and Faster Algorithms for Maximum Flow
2013Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back
2012A multi-prover interactive proof for NEXP sound against entangled provers
2012A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
2011A Polylogarithmic-Competitive Algorithm for the k-Server Problem
20113-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
2011A Randomized Rounding Approach to the Traveling Salesman Problem
2011Approximating Graphic TSP by Matchings
2010Computational Transition at the Uniqueness Threshold
2010Subexponential Algorithms for Unique Games and Related Problems
2010Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions
2008Two Query PCP with Sub-Constant Error
2007Space-Efficient Identity Based EncryptionWithout Pairings
2006Settling the Complexity of 2-Player Nash Equilibrium
2005Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
2005The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1
2004Cryptography in NC0
2004Hardness of Approximating the Shortest Vector Problem in Lattices
2003On the Impossibility of Dimension Reduction in l1
2002Minimizing Congestion in General Networks
2002A Dichotomy Theorem for Constraints on a Three-Element Set
2002Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model

Related Conferences

Related Journals

Comments 0

No comments yet.

Please Login to post a comment