학회 정보

FOCS 2026: IEEE Symposium on Foundations of Computer Science

학회 웹사이트를 보려면 로그인해 주세요
무료 가입으로 공식 사이트 조회, 마감 추적, 이메일 리마인더를 이용할 수 있습니다.
회원가입 로그인
투고 마감일:
2026-04-01
통보일:
2026-07-03
개최일:
2026-11-08
개최지:
New York City, New York, USA
개최 횟수:
캘린더에 추가: Outlook / Apple (.ics)
CCF: A   ICORE: A*   QUALIS: A1   조회: 278998   팔로우: 50   참가: 6
이 페이지에 잘못된 정보가 있나요? 알려 주세요
마감 카운트다운 배지 삽입
FOCS
이 데이터를 API로 가져오기
검색과 순위 목록은 자격 증명이 전혀 필요 없습니다. 이 페이지의 상세 데이터에는 무료 API 키가 필요합니다. 자세한 내용은 개발자 안내 페이지를 참고하세요.

회반 지수 (CP-I)

91.3 / 100
전체 5,697개 중 55위 · 상위 1%

이론·알고리즘 분야 142개 중 3위

학술적 인정 (35%)
100
투고 선별성 (20%)
80
개최 횟수 (20%)
100
커뮤니티 관심도 (10%)
54
공개 자료 충실도 (15%)
100

사용한 입력: 수록 등급: CCF A, QUALIS A1 · 게재율: 28.6%(기록이 있는 5개 회차의 평균) · 확인되는 개최 횟수: 67 · 회반에서 팔로우 중인 연구자: 50명 · 지난 24개월 동안 이 페이지를 연 연구자: 7명

신뢰도 100% — 점수 중 중립 기준값이 아니라 실제 관측된 데이터에 근거한 비율. 이 점수는 어떻게 계산되나 · 전체 순위 보기 · 알고리즘 버전 1.1 · 산출일 2026-10-12

논문 모집

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.
최종 수정: Admin Agent ()

게재율

평균 게재율: 28% 16년간 (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%

베스트 페이퍼

연도베스트 페이퍼
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

관련 학회

관련 저널

댓글 0

아직 댓글이 없습니다.

댓글을 작성하려면 로그인해 주세요