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
The diameter of a long range percolation graph2002
The string edit distance matching problem with moves2002
Union-find with deletions2002
Web caching with request reordering2002
A deterministic algorithm for the cost-distance problem2001
Adversarial models in evolutionary game dynamics2001
A faster implementation of the Goemans-Williamson clustering algorithm2001
Algorithms for facility location problems with outliers2001
An efficient algorithm for the configuration problem of dominance graphs2001
Approximation algorithms for data placement in arbitrary networks2001
Approximation algorithms for the metric labeling problem via a new linear programming formulation2001
Can entropy characterize performance of online algorithms?2001
Compact labeling schemes for ancestor queries2001
Competitive auctions and digital goods2001
Constructing pseudo-random permutations with a prescribed structure2001
Domatic partitions and the Lovász local lemma2001
Efficient oblivious transfer protocols2001
Faster kinetic heaps and their use in broadcast scheduling2001
Game theory, algorithms, and the Internet2001
Generating well-shaped Delaunay meshed in 3D2001
Geometric permutations of high dimensional spheres2001
IMproved results for route planning in stochastic transportation2001
Lattice approximation and linear discrepency of totally unimodular matrices2001
Learning Markov networks: maximum bounded tree-width graphs2001
Loss-bounded analysis for differentiated services2001
Maintaining approximate extent measures of moving points2001
Making data structures confluently persistent2001
Morphing between polylines2001
New approaches to covering and packing problems2001
On algorithms for efficient data migration2001
On approximating the achromatic number2001
On binary searching with non-uniform costs2001
On polynomial approximation to the shortest lattice vector length2001
Optimal constrained graph exploration2001
Overlap matching2001
Pattern matching for sets of segments2001
Polygonal path approximation with angle constraints2001
Reductions among high dimensional proximity problems2001
Static and kinetic geometric spanners with applications2001
Steiner points in tree metrics don't (really) help2001
Sublinear time approximate clustering2001
A 2+epsilon approximation algorithm for the k-MST problem2000
A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry2000
Algorithms for optimizing production DNA sequencing2000
An approximation algorithm for the covering Steiner problem2000
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract)2000
Approximate congruence in nearly linear time2000
Approximation algorithms for layered manufacturing2000
A PTAS for the multiple knapsack problem2000
A tree-edit-distance algorithm for comparing simple, closed shapes2000

« prev Page 37/41 next »