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

Deadlines, Rankings
& Best Papers — all in one.

Acceptance rates · Best papers · Conference deadlines for CS researchers

← 학회 목록으로

SODA

TheoryD-77

ACM-SIAM Symposium on Discrete Algorithms

📍 Philadelphia, PA, USA · 2027-01-24 ~ 2027-01-27

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

기관 인정 현황?

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

데드라인

2026 (main)
📍 Vancouver, Canada
📝 Paper: 2025-07-14
📬 Notification: 2025-10-01
📅 학회: 2026-01-11 ~ 2026-01-14
2027 (main)
📍 Philadelphia, PA, USA
📝 Paper: 2026-07-09
📅 학회: 2027-01-24 ~ 2027-01-27

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

Acceptance Rate?

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

Research Trend?

Best Papers

🏆 2025Best Paper Award
Improved List Size for Folded Reed-Solomon Codes
Shashank Srivastava
🏆 2024Best Paper Award
Breaking the Metric Voting Distortion Barrier
Moses CharikarPrasanna RamakrishnanKangning WangHongxun Wu
🏆 2024Best Paper Award
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
Monika HenzingerJason LiSatish RaoDi Wang
🏆 2023Best Paper Award
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
Bhattacharya et al.
MatchingDynamic Algorithms
🏆 2023Best Paper Award
Dynamic Algorithms for Maximum Matching Size
Soheil Behnezhad
🏆 2022Best Paper Award
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √n Barrie
Shimon Kogan & Merav Parter
🏆 2021Best Paper Award
Solving Sparse Linear Systems Faster than Matrix Multiplication
Richard PengSantosh Vempala
Sparse Methods
🏆 2020Best Paper Award
Chasing Convex Bodies Optimally
Mark Sellke
🏆 2020Best Paper Award
Chasing Convex Bodies with Linear Competitive Ratio
C.J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang

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

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

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

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