학회 정보

SODA 2027: ACM-SIAM Symposium on Discrete Algorithms

학회 웹사이트를 보려면 로그인해 주세요
무료 가입으로 공식 사이트 조회, 마감 추적, 이메일 리마인더를 이용할 수 있습니다.
회원가입 로그인
투고 마감일:
2026-07-09 마감됨
통보일:
개최일:
2027-01-24
개최지:
Philadelphia, Pennsylvania, USA
개최 횟수:
CCF: A   ICORE: A*   QUALIS: A1   조회: 539502   팔로우: 38   참가: 3
이 페이지에 잘못된 정보가 있나요? 알려 주세요
마감 카운트다운 배지 삽입
SODA
이 데이터를 API로 가져오기
검색과 순위 목록은 자격 증명이 전혀 필요 없습니다. 이 페이지의 상세 데이터에는 무료 API 키가 필요합니다. 자세한 내용은 개발자 안내 페이지를 참고하세요.

회반 지수 (CP-I)

87.7 / 100
전체 5,749개 중 107위 · 상위 2%

이론·알고리즘 분야 142개 중 6위

학술적 인정 (35%)
100
투고 선별성 (20%)
77
개최 횟수 (20%)
84
커뮤니티 관심도 (10%)
55
공개 자료 충실도 (15%)
100

사용한 입력: 수록 등급: CCF A, QUALIS A1 · 게재율: 31.3%(기록이 있는 5개 회차의 평균) · 확인되는 개최 횟수: 22 · 회반에서 팔로우 중인 연구자: 38명 · 지난 24개월 동안 이 페이지를 연 연구자: 13명

신뢰도 100% — 점수 중 중립 기준값이 아니라 실제 관측된 데이터에 근거한 비율. 이 점수는 어떻게 계산되나 · 전체 순위 보기 · 알고리즘 버전 1.2 · 산출일 2026-10-21

논문 모집

SODA 2027 (ACM-SIAM Symposium on Discrete Algorithms) is a CCF A / ICORE A* / QUALIS A1 conference held in Philadelphia, Pennsylvania, USA on 2027-01-24. The paper submission deadline is 2026-07-09.

Included Themes Aspects of combinatorics and discrete mathematics, such as: Combinatorial and geometric structures Discrete optimization Graph theory and graph algorithms Random structures and probabilistic methods Core topics in discrete algorithms, such as: Algorithm design and analysis Approximation and randomized algorithms Data structures Dynamic, streaming, and sub-linear algorithms Experimental algorithms Fixed-parameter tractability Lower bounds and fine-grained complexity Mathematical programming Online algorithms Algorithmic aspects of other areas of computer science, such as: Algorithmic aspects of fairness Algorithmic coding theory Combinatorial scientific computing Communication networks and the internet Computational geometry and topology Computer systems Cryptography, security, and privacy Databases and information retrieval Distributed and parallel computing Game theory and mechanism design Machine learning and AI Quantum computing Scheduling and resource allocation
최종 수정: Admin Agent ()

게재율

평균 게재율: 30.1% 17년간 (2005–2021).

연도투고 수게재 수게재율(%)
202164118028.1%
202059418230.6%
201959118331%
201854718032.9%
201753318134%
201652714928.3%
201549513727.7%
201448513628%
201345413529.7%
201251713826.7%
201145213630.1%
201044513530.3%
200945813529.5%
200845513529.7%
200738213936.4%
200644013530.7%
200548813527.7%

베스트 페이퍼

연도베스트 페이퍼
2026Is Nasty Noise Actually Harder Than Malicious Noise?
2026Existence of Fair and Efficient Allocation of Indivisible Chores
2025Quasi-Monte Carlo Beyond Hardy-Krause
2025Improved List Size for Folded Reed-Solomon Codes
2024Deterministic Near-linear Time Minimum Cut in Weighted Graphs
2024Breaking the Metric Voting Distortion Barrier
2023Dynamic Algorithms for Maximum Matching Size
2023Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
2022New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √n Barrie
2021Solving Sparse Linear Systems Faster than Matrix Multiplication
2020Chasing Convex Bodies with Linear Competitive Ratio
2020Chasing Convex Bodies Optimally
2019Sublinear Algorithms for (∆ + 1) Vertex Coloring
2018Approaching 3/2 for the s-t-path TSP
2018Online Bipartite Matching with Amortized O(log2 N)Replacements
2017A (2 + Є) Approximation for Maximum Weight Matching in the Semi-Streaming Model
2017Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
2016Near-Optimal Light Spanners
2016An Improved Distributed Algorithm for Maximal Independent Set
2015The Parameterized Complexity of k-Biclique
2014An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
2014Polynomiality for Bin Packing with a Constant Number of Item Types
2013Dynamic graph connectivity in polylogarithmic worst case time
2013A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory
2012Computing all maps into a sphere
2011An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
2010An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
2009Natural Algorithms

이 항목을 본 사람들이 함께 본 항목

CCFICORECP-I약칭정식 명칭투고 마감개최일
AA*97.3INFOCOMInternational Conference on Computer Communications2026-07-242027-05-24
BA*97.5IJCAIInternational Joint Conference on Artificial Intelligence2027-01-042027-08-07
AA*97.8AAAIAAAI Conference on Artificial Intelligence2026-07-212027-02-16

관련 학회

CCFICORECP-I약칭정식 명칭투고 마감개최일
40.7ACDASIAM Conference on Applied and Computational Discrete Algorithms2026-09-082027-02-22
C46.1DMSIAM Conference on Discrete Mathematics2025-12-222026-06-22
AA*95.8SIGIRInternational Conference on Research and Development in Information Retrieval2027-01-142027-07-18
AA*97.8AAAIAAAI Conference on Artificial Intelligence2026-07-212027-02-16
AA*94.7CVPRIEEE Conference on Computer Vision and Pattern Recognition2026-11-102027-06-20
AA*92.9STOCACM Symposium on Theory of Computing2026-11-022027-06-06
AA*95.4OSDIUSENIX Symposium on Operating Systems Design and Implementation2026-12-012027-07-07
AA*95.2ICMLInternational Conference on Machine Learning2026-01-232026-07-06
AA*97.3INFOCOMInternational Conference on Computer Communications2026-07-242027-05-24
AA*89.4ICCVInternational Conference on Computer Vision2025-03-072025-10-19

관련 저널

댓글 0

아직 댓글이 없습니다.

댓글을 작성하려면 로그인해 주세요