会议信息

FOCS 2025: IEEE Symposium on Foundations of Computer Science

请登录查看会议网址

截稿日期:
2025-04-03
通知日期:
2025-07-08
会议日期:
2025-12-14
会议地点:
Sydney, Australia
届数:
66
CCF: a   CORE: a*   QUALIS: a1   浏览: 271821   关注: 49   参加: 6

征稿

FOCS 2025 (IEEE Symposium on Foundations of Computer Science) is a CCF A / CORE A* / QUALIS A1 conference held in Sydney, Australia on 2025-12-14. The paper submission deadline is 2025-04-03. Acceptance notifications are sent on 2025-07-08.

The 66th Annual Symposium on Foundations of Computer Science (FOCS 2025), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held in Sydney, Australia, December 14-17. 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: algorithmic coding theory, algebraic computation, algorithmic graph theory, algorithmic game theory, algorithms and data structures, analysis of Boolean functions, approximation algorithms, average-case complexity, computational applications of logic, combinatorics, computational complexity, communication complexity, circuit complexity, combinatorial optimization, computational game theory, computational geometry, computational learning theory, continuous optimization, cryptography, foundations of machine learning, online algorithms, optimization, parallel and distributed algorithms, parameterized algorithms, randomized algorithms, sublinear algorithms, streaming algorithms, quantum computing, pseudorandomness and derandomization, foundations of fairness and privacy, and theoretical aspects of areas such as networks, information retrieval, computational biology, and databases. Papers that broaden the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.
最后更新 Dou Sun 在

录取率

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

时间提交数录取数录取率(%)
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%

最佳论文

时间最佳论文
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
2020A New Minimax Theorem for Randomized Algorithms
2020Edge-Weighted Online Bipartite Matching
2020An Equivalence Between Private Classification and Online Prediction
2019Efficient Construction of Rigid Matrices Using an NP Oracle
2019Lower bounds for maximal matchings and maximal independent sets
2019NEEXP ⊆ MIP*
2019Automating Resolution is NP-Hard
2019Faster Minimum k-cut of a Simple Graph
2018Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion
2018Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time
2018Classical Verification of Quantum Computation
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 Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
2012A multi-prover interactive proof for NEXP sound against entangled provers
2011Approximating Graphic TSP by Matchings
2011A Randomized Rounding Approach to the Traveling Salesman Problem
20113-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
2011A Polylogarithmic-Competitive Algorithm for the k-Server Problem
2010Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions
2010Subexponential Algorithms for Unique Games and Related Problems
2010Computational Transition at the Uniqueness Threshold
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
2004Hardness of Approximating the Shortest Vector Problem in Lattices
2004Cryptography in NC0
2003On the Impossibility of Dimension Reduction in l1
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
2002Minimizing Congestion in General Networks

相关会议

CCFCOREQUALIS简称全称截稿日期通知日期会议日期
FCST''International Conference on Foundations of Computer Science & Technology2023-05-062023-05-202023-05-27
CST'International Conference on Foundations of Computer Science & Technology2024-08-032024-08-242022-11-12
aa*a1AAAIAAAI Conference on Artificial Intelligence2025-07-252025-11-032026-01-20
aa*a1SIGIRInternational Conference on Research and Development in Information Retrieval2026-01-152026-04-022026-07-20
aa*a1CVPRIEEE Conference on Computer Vision and Pattern Recognition2025-11-062026-02-202026-06-03
aa*a1IJCAIInternational Joint Conference on Artificial Intelligence2026-01-312026-08-15
aa*a1STOCACM Symposium on Theory of Computing2025-11-042026-02-012026-06-22
aa*a1OSDIUSENIX Symposium on Operating Systems Design and Implementation2025-12-042026-03-262026-07-13
aa*a1ICMLInternational Conference on Machine Learning2026-01-232026-07-06
aa*a1INFOCOMInternational Conference on Computer Communications2025-07-242025-12-082026-05-18

相关期刊


惊喜