SODA Topic Selection & Conference Routing
Evaluates theoretical computer science results against ACM-SIAM SODA fit criteria and routes papers to optimal target venues.
SODA Topic Selection helps theoretical computer science and algorithms researchers determine whether their work fits the ACM-SIAM Symposium on Discrete Algorithms (SODA) or belongs at alternative venues like STOC, FOCS, ESA, ICALP, ITCS, SOSA, ALENEX, or SoCG. Using a structured three-question fit test, verified exemplar benchmarks, and grey-zone adjudication rules, this skill analyzes research contributions based on quantitative bound advancements, expert legibility, and discrete-algorithmic techniques to provide venue recommendations, anti-fit detection, and problem-first abstract framing.
Key Features
01Venue routing map covering STOC, FOCS, ITCS, ESA, ICALP, SOSA, ALENEX, and SoCG
02Three-question fit assessment evaluating quantitative bounds, expert legibility, and discrete techniques
031,090 GitHub stars
04Problem-lineage framing strategies tailored for algorithms-first reviewer benches
05Borderline case adjudication for new models, lower bounds, and simplified proofs
06Anti-fit pattern detection to prevent manuscript desk rejects and misalignment
Use Cases
01Deciding whether a lower-bound or complexity result fits SODA versus STOC, FOCS, or CCC
02Reframing research draft abstracts around concrete problem lineages and quantitative frontiers
03Evaluating whether a new algorithmic speedup or data structure is best submitted to SODA, SOSA, or ESA