# FOCS — IEEE Symposium on Foundations of Computer Science

- **Submission deadline**: 2026-04-01
- **Notification date**: 2026-07-03
- **Conference date**: 2026-11-08
- **Location**: New York City, New York, USA
- **Rankings**: CCF A · CORE A* · QUALIS A1
- **Trackers**: 50
- **Attendees**: 6
- **Canonical page**: https://www.myhuiban.com/conference/361

## Acceptance history

| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| 2020 | 399 | 127 | 31.8% |
| 2019 | 318 | 92 | 28.9% |
| 2018 | 320 | 86 | 26.9% |
| 2017 | 323 | 90 | 27.9% |
| 2016 | 307 | 85 | 27.7% |
| 2015 | 314 | 86 | 27.4% |
| 2014 | 273 | 68 | 24.9% |
| 2013 | 281 | 79 | 28.1% |
| 2012 | 248 | 79 | 31.9% |
| 2011 | 292 | 85 | 29.1% |

## Past editions

| Year | Deadline | Conference date | Location |
|---|---|---|---|
| 2025 | 2025-04-03 | 2025-12-14 | Sydney, Australia |

## Call for papers

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.

## Related conferences

- FCST'' — International Conference on Foundations of Computer Science & Technology — https://www.myhuiban.com/conference/3006
- CST' — International Conference on Foundations of Computer Science & Technology — https://www.myhuiban.com/conference/1361
- SIGIR — International Conference on Research and Development in Information Retrieval — https://www.myhuiban.com/conference/141
- AAAI — AAAI Conference on Artificial Intelligence — https://www.myhuiban.com/conference/408
- CVPR — IEEE Conference on Computer Vision and Pattern Recognition — https://www.myhuiban.com/conference/407

## Related journals

- Foundations of Computational Mathematics — https://www.myhuiban.com/journal/479
- IEEE Computer — https://www.myhuiban.com/journal/321
- IEEE Transactions on Multimedia — https://www.myhuiban.com/journal/152
- IEEE Transactions on Computers — https://www.myhuiban.com/journal/3
- IEEE Transactions on Dependable and Secure Computing — https://www.myhuiban.com/journal/9

---
Source: Conference Partner — https://www.myhuiban.com/conference/361 (rankings reproduced from CCF / ICORE / QUALIS; data cached up to 1 hour)