Skip to content

ACM/SIAM Symposium on Discrete Algorithms

SODA

A*

CORE rank

CORE rank (raw)

A*

Acceptance rate

32.0% (2024)

Fields of research

Theory of Computation

Papers indexed

4,977

1990–2026

Papers per year

1990243 peak2026

SODA papers

4,977 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2008Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities.Ashish Goel, Hamid Nazerzadeh
2008Online budgeted matching in random input models with applications to Adwords.Gagan Goel, Aranyak Mehta
2008Balls and bins with structure: balanced allocations on hypergraphs.Brighten Godfrey
2008On clustering to minimize the sum of radii.Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan
2008Charity auctions on social networks.Arpita Ghosh, Mohammad Mahdian
2008Stochastic analyses for online combinatorial optimization problems.Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski
2008Geodesic Delaunay triangulation and witness complex in the plane.Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
2008Iterated rounding algorithms for the smallestHarold N. Gabow, Suzanne Gallagher
2008Robust cost colorings.Takuro Fukunaga, Magns M. Halldrsson, Hiroshi Nagamochi
2008Competitive queue management for latency sensitive packets.Amos Fiat, Yishay Mansour, Uri Nadav
2008On distributing symmetric streaming computations.Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina
2008On allocations that maximize fairness.Uriel Feige
2008Two-phase greedy algorithms for some classes of combinatorial linear programs.Ulrich Faigle, Britta Peis
2008The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond.Alex Fabrikant, Christos H. Papadimitriou
2008Approximating geometric coverage problems.Thomas Erlebach, Erik Jan van Leeuwen
2008On distance to monotonicity and longest increasing subsequence of a data stream.Funda Ergn, Hossein Jowhari
2008Recognizing partial cubes in quadratic time.David Eppstein
2008A near-linear time algorithm for computing replacement paths in planar directed graphs.Yuval Emek, David Peleg, Liam Roditty
2008The power of memory in randomized broadcasting.Robert Elssser, Thomas Sauerwald
2008Approximating connected facility location problems via random facility sampling and core detouring.Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvo, Guido Schfer
2008Exact and efficient 2D-arrangements of arbitrary algebraic curves.Arno Eigenwillig, Michael Kerber
2008Graph balancing: a special case of scheduling unrelated parallel machines.Toms Ebenlendr, Marek Krcl, Jir Sgall
2008A tight lower bound for parity in noisy communication networks.Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan
2008On stars and Steiner stars.Adrian Dumitrescu, Csaba D. Tth
2008Minimum weight convex Steiner partitions.Adrian Dumitrescu, Csaba D. Tth
3,0763,100 of 4,977← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.