🏠홈📊트렌드🏆논문👤마이
🎓
CS-Pedia
TrendsBest Papers
CS Conference Hub

Deadlines, Rankings
& Best Papers — all in one.

Acceptance rates · Best papers · Conference deadlines for CS researchers

← 학회 목록으로

FOCS

Theory마감

IEEE Annual Symposium on Foundations of Computer Science

📍 New York City, USA · 2026-11-08 ~ 2026-11-11

공식 웹사이트DBLP정보 오류 신고
키워드ComplexityTestingConvexGraphDistributed

기관 인정 현황?

BK21
4점
KIISE
최우수
KAIST
최우수
SNU
✓
POST
최우수

데드라인

2026 (main)
📍 New York City, USA
📝 Paper: 2026-04-01
📬 Notification: 2026-07-03
📅 학회: 2026-11-08 ~ 2026-11-11

데드라인은 변경될 수 있습니다. 제출 전 공식 웹사이트에서 최종 일정을 확인하세요.

Acceptance Rate?

연도제출채택채택률
2022—118—

Research Trend?

Best Papers

🏆 2025Best Paper Award
Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest
Ahmadi, Gholami, Hajiaghayi, Jabbarzade & Mahdavi
Approximation AlgorithmsGraph Theory
🏆 2025Best Paper Award
Explicit Lossless Vertex Expanders
Hsieh, Lubotzky, Mohanty, Reiner & Zhang
Expander GraphsCombinatorics
🏆 2025Best Paper Award
Quasipolynomial Bounds for the Corners Theorem
Jaber, Liu, Lovett, Ostuni & Sawhney
CombinatoricsAdditive Combinatorics
🏆 2023Best Paper Award
Strong Bounds for 3-Progressions
Kelley & Meka
CombinatoricsAdditive
🏆 2023Best Paper Award
The Subspace Flatness Conjecture and Faster Integer Programming
Victor Reis & Thomas Rothvoss
🏆 2022Best Paper Award
Negative-Weight Single-Source Shortest Paths in Near-Linear Time
Bernstein et al.
Shortest PathsAlgorithms
🏆 2022Best Paper Award
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
🏆 2021Best Paper Award
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
Limaye, Srinivasan & Tavenas
Circuit ComplexityLower Bounds
🏆 2020Best Paper Award
An Equivalence Between Private Classification and Online Prediction
Mark Bun, Roi Livni, Shay Moran
Classification
🏆 2020Best Paper Award
Edge-Weighted Online Bipartite Matching
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
🏆 2020Best Paper Award
A New Minimax Theorem for Randomized Algorithms
Shalev Ben-David & Eric Blais
Randomized Algorithms

CS-Pedia — 한국 CS 연구자를 위한 학회 통합 플랫폼

데이터 출처: DBLP (CC0), OpenAlex (CC0), Semantic Scholar, aideadlin.es (MIT), 한국연구재단, 한국정보과학회, jeffhuang.com

제출 전 데드라인·학회 일정은 공식 웹사이트에서 반드시 확인하세요.

소개·개인정보 처리방침·이용약관·문의