SODA

2,036 papers555 directions
SODA (Symposium on Discrete Algorithms) is a research venue active since 1990 that focuses on the design and analysis of discrete algorithms. With a corpus of over 2,500 papers, it serves as a foundational outlet for theoretical research that informs machine learning and artificial intelligence. The venue is characterized by its emphasis on approximation algorithms, combinatorial optimization, and the mathematical limits of computation. In the context of AI and machine learning, SODA publishes research on online matching and selection, fair division of indivisible items, and robust selection under adversarial or random arrivals. Other significant research directions include spectral methods for directed graph signal processing, fully dynamic optimization for evolving data streams, and the efficiency of auction mechanisms. The venue also features work on learning theory, such as lower bounds for decision tree learning, and the development of faster linear systems through multi-level sketched preconditioning. The venue hosts contributions from prolific researchers including Anupam Gupta, David P. Woodruff, Haim Kaplan, and Piotr Indyk. Recent publications highlight a focus on bridging asymptotic optimality with practical algorithmic efficiency, covering topics like matrix norm approximation and massively parallel minimum spanning trees. By addressing the computational costs and theoretical constraints of algorithms, SODA provides the mathematical frameworks necessary for advancing data processing and automated decision-making systems.

Papers by Year

2026 82
2025 100
2024 103
2023 97
2022 93
2021 117
2020 103
2019 116
2018 112
2017 102
2016 91
2015 79
2014 77
2013 80
2012 62
2011 57
2010 60
2009 66
2008 56
2007 51
2006 51
2005 58
2004 41
2003 38
2002 38
2001 37
2000 35
1999 40
1998 17
1997 23
1996 12
1995 15
1994 14
1993 8
1992 10
1991 14
1990 7

Top Research Directions

Research directions most represented by papers from this venue.

The Empirical Validation Gap 35
Transitioning from Monte Carlo to Deterministic Graph Algorithms 32
Tightening Theoretical Bounds by Optimizing Constant Factors 28
From Fractional Solutions to Discrete Decisions 27
The Computational Cost of High Precision 14
Extending Structural Graph Properties to Broader Graph Classes 12
Irrevocable Decisions in Online Resource Allocation 12
Incremental Maintenance of Dynamic Graph Indices 12
Closing the Optimality Gap in Online Algorithms 11
Proving Computational Intractability Through Hardness Reductions 11
Managing Hidden Constant Overhead in Algorithm Design 11
Proving Algorithmic Optimality via Complexity Conjectures 10
Online Optimization Under Adversarial Arrival Orders 10
Graph Algorithms Under Semi-Streaming Space Constraints 9
Deterministic Approximation via Spatial Correlation Decay 8

Top Authors

AuthorPapers
Anupam Gupta51
MohammadTaghi Hajiaghayi43
Chandra Chekuri35
David Woodruff33
Haim Kaplan33
Monika Henzinger26
Pinyan Lu26
Piotr Indyk24
Vahab Mirrokni24
Yossi Azar23
Aravind Srinivasan22
Benjamin Moseley21
Kurt Mehlhorn21
Robert Kleinberg21
Aaron Sidford20
Ilias Diakonikolas18
Meirav Zehavi18
Ravi Kumar18
Debmalya Panigrahi17
Shi Li17

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques1993
Lower Bounds for Set Intersection Queries1993
On-line Choice of On-line Algorithms1993
On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas1993
Ray Shooting Amidst Convex Polytopes in Three Dimensions1993
Comparison-Sorting and Selecting in Totally Monotone Matrices1992
Dynamic Point Location in General Subdivisions1992
Lower Bounds for On-Line Graph Coloring1992
Relative Neighborhood Graphs in Three Dimensions1992
Self-Testing Polynomial Functions Efficiently and Over Rational Domains1992
Tail Estimates for the Space Complexity of Randomized Incremental Algorithms1992
The Competitiveness of On-Line Assignments1992
The Probabilistic Method1992
The Robot Localization Problem in Two Dimensions1992
(Un)expected Behavior of Typical Suffix Trees1992
Algorithms and Complexity Analysis for Some Flow Problems1991
Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations1991
Complexity Results and Algorithms for { <, <=, = }-Constrained Scheduling1991
Computing a Face in an Arrangement of Line Segments1991
Density Graphs and Separators1991
Fast Hashing on a PRAM - Designing by Expectation1991
Improved Approximation Algorithms for Shop Scheduling Problems1991
On the Parallel Complexity of Evaluating Game Trees1991
Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice1991
Planar Geometric Location Problems and Maintaining the Width of a Planar Set1991
The Fourth Moment Method1991
Tight Bounds for On-Line Tree Embeddings1991
Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm1991
Triangulating Three-Colored Graphs1991
Approximation Algorithms for the Maximum Acyclic Subgraph Problem1990
Compact Interval Trees: A Data Structure for Convex Hulls1990
Determining the Evolutionary Tree1990
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls1990
Incremental Algorithms for Minimal Length Paths1990
The Bisection Width of Grid Graphs1990
Visibility with a Moving Point of View1990

« prev Page 41/41