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

Deadlines, Rankings
& Best Papers — all in one.

Acceptance rates · Best papers · Conference deadlines for CS researchers

← 학회 목록으로

STOC

Theory마감

ACM Symposium on Theory of Computing

📍 Salt Lake City, UT, USA · 2026-06-22 ~ 2026-06-26

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

기관 인정 현황?

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

데드라인

2026 (main)
📍 Salt Lake City, UT, USA
📝 Paper: 2025-11-04
📬 Notification: 2026-02-01
📅 학회: 2026-06-22 ~ 2026-06-26

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

Acceptance Rate?

채택률 데이터가 없습니다.

Research Trend?

Best Papers

🏆 2025Best Paper Award
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
Ran DuanJiayi MaoXiao MaoXinkai ShuLonghui Yin
algorithmsgraph algorithmsshortest paths
🏆 2025Best Paper Award
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
Yeyuan ChenZihan Zhang
coding theoryerror-correcting codescomplexity theory
🏆 2025Best Paper Award
Vizing's Theorem in Near-Linear Time
Sepehr AssadiSoheil BehnezhadSayan BhattacharyaMartín CostaShay SolomonTianyi Zhang
algorithmsgraph theoryedge coloring
🏆 2024Best Paper Award
Single-Source Shortest Paths with Negative Real Weights in Õ(mn^{8/9}) Time
Fineman
Shortest PathsGraph Algorithms
🏆 2024Best Paper Award
Near Optimal Alphabet-Soundness Tradeoff PCPs
Minzer & Zheng
PCPComplexity Theory
🏆 2024Best Paper Award
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
Guruswami, Lin, Ren, Sun & Wu
Parameterized ComplexityInapproximability
🏆 2023Best Paper Award
The Randomized k-Server Conjecture Is False!
Bubeck et al.
k-ServerOnline Algorithms
🏆 2023Best Paper Award
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
Wei Kai Lin, Ethan Mook, Daniel Wichs
Information RetrievalEfficiencyHomomorphic Encryption
🏆 2022Best Paper Award
Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
Pavel PanteleevGleb Kalachev
quantum computingcoding theoryerror-correcting codes
🏆 2022Best Paper Award
Locally Testable Codes with Constant Rate, Distance, and Locality
Irit DinurShai EvraRon LivneAlexander LubotzkyShahar Mozes
coding theoryerror-correcting codescomplexity theory
🏆 2021Best Paper Award
A (Slightly) Improved Approximation Algorithm for Metric TSP
Anna R. KarlinNathan KleinShayan Oveis Gharan
algorithmsapproximationtraveling salesmancombinatorial optimization
🏆 2021Best Paper Award
Indistinguishability Obfuscation from Well-Founded Assumptions
Aayush JainHuijia LinAmit Sahai
cryptographyobfuscationhardness assumptions
🏆 2021Best Paper Award
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
John FearnleyPaul W. GoldbergAlexandros HollenderRahul Savani
complexity theorygradient descentalgorithms
🏆 2020Best Paper Award
Improved Bounds for The Sunflower Lemma
Ryan Alweiss, Shachar Lovett, Kewen Wu, Jiapeng Zheng

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

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

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

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