🏠
홈
📊
트렌드
🏆
논문
👤
마이
💬 문의
CS-
Pedia
Trends
Best Papers
Best Papers
/
SODA
SODA Best Papers
ACM-SIAM Symposium on Discrete Algorithms
12 papers · 2020–2025
← SODA Conference Info
🏆
2025
(3)
Best Paper Award
Improved List Size for Folded Reed-Solomon Codes
Shashank Srivastava
Best Paper Award
Quasi-Monte Carlo Beyond Hardy-Krause
Nikhil Bansal, Haotian Jiang
Best Paper Award
Tight Streaming Lower Bounds for Deterministic Approximate Counting
Yichuan Wang
🏆
2024
(3)
Best Paper Award
Breaking the Metric Voting Distortion Barrier
Moses CharikarPrasanna RamakrishnanKangning WangHongxun Wu
Best Paper Award
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
Monika HenzingerJason LiSatish RaoDi Wang
Best Paper Award
New Explicit Constant-degree Lossless Expanders
Louis Golowich
🏆
2023
(2)
Best Paper Award
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
Bhattacharya et al.
Matching
Dynamic Algorithms
Best Paper Award
Dynamic Algorithms for Maximum Matching Size
Soheil Behnezhad
🏆
2022
(1)
Best Paper Award
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √n Barrie
Shimon Kogan & Merav Parter
🏆
2021
(1)
Best Paper Award
Solving Sparse Linear Systems Faster than Matrix Multiplication
Richard PengSantosh Vempala
Sparse Methods
🏆
2020
(2)
Best Paper Award
Chasing Convex Bodies Optimally
Mark Sellke
Best Paper Award
Chasing Convex Bodies with Linear Competitive Ratio
C.J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang