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

Deadlines, Rankings
& Best Papers — all in one.

Acceptance rates · Best papers · Conference deadlines for CS researchers

Best Papers/STOC

STOC Best Papers

ACM Symposium on Theory of Computing

14 papers · 2020–2025

← STOC 학회 정보

🏆 2025(3)

Best Paper Award
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
Ran DuanJiayi MaoXiao MaoXinkai ShuLonghui Yin
algorithmsgraph algorithmsshortest paths
Best Paper Award
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
Yeyuan ChenZihan Zhang
coding theoryerror-correcting codescomplexity theory
Best Paper Award
Vizing's Theorem in Near-Linear Time
Sepehr AssadiSoheil BehnezhadSayan BhattacharyaMartín CostaShay SolomonTianyi Zhang
algorithmsgraph theoryedge coloring

🏆 2024(3)

Best Paper Award
Single-Source Shortest Paths with Negative Real Weights in Õ(mn^{8/9}) Time
Fineman
Shortest PathsGraph Algorithms
Best Paper Award
Near Optimal Alphabet-Soundness Tradeoff PCPs
Minzer & Zheng
PCPComplexity Theory
Best Paper Award
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
Guruswami, Lin, Ren, Sun & Wu
Parameterized ComplexityInapproximability

🏆 2023(2)

Best Paper Award
The Randomized k-Server Conjecture Is False!
Bubeck et al.
k-ServerOnline Algorithms
Best 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

🏆 2022(2)

Best Paper Award
Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
Pavel PanteleevGleb Kalachev
quantum computingcoding theoryerror-correcting codes
Best Paper Award
Locally Testable Codes with Constant Rate, Distance, and Locality
Irit DinurShai EvraRon LivneAlexander LubotzkyShahar Mozes
coding theoryerror-correcting codescomplexity theory

🏆 2021(3)

Best Paper Award
A (Slightly) Improved Approximation Algorithm for Metric TSP
Anna R. KarlinNathan KleinShayan Oveis Gharan
algorithmsapproximationtraveling salesmancombinatorial optimization
Best Paper Award
Indistinguishability Obfuscation from Well-Founded Assumptions
Aayush JainHuijia LinAmit Sahai
cryptographyobfuscationhardness assumptions
Best Paper Award
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
John FearnleyPaul W. GoldbergAlexandros HollenderRahul Savani
complexity theorygradient descentalgorithms

🏆 2020(1)

Best 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

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

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