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
2007Buying cheap is expensive: hardness of non-parametric multi-product pricing.Patrick Briest, Piotr Krysta
2007Approximating entropy from sublinear samples.Mickey Brautbar, Alex Samorodnitsky
2007On the bandwidth conjecture for 3-colourable graphs.Julia Bttcher, Mathias Schacht, Anusch Taraz
2007Fast computation of power series solutions of systems of differential equations.Alin Bostan, Frdric Chyzak, Franois Ollivier, Bruno Salvy, ric Schost, Alexandre Sedoglavic
2007A polynomial-time approximation scheme for Steiner tree in planar graphs.Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein
2007An unbiased pointing operator for unlabeled structures, with applications to counting and sampling.Manuel Bodirsky, ric Fusy, Mihyun Kang, Stefan Vigerske
2007Algorithms and incentives for robust ranking.Rajat Bhattacharjee, Ashish Goel
2007Succinct indexes for strings, binary relations and multi-labeled trees.Jrmy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
2007Speed scaling for weighted flow time.Nikhil Bansal, Kirk Pruhs, Clifford Stein
2007Harmonic algorithm for 3-dimensional strip packing problem.Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang
2007Dynamic pricing for impatient bidders.Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
2007Approximation algorithms for embedding general metrics into trees.Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos
2007The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits.Dave Bacon, Isaac L. Chuang, Aram W. Harrow
2007Matroids, secretary problems, and online mechanisms.Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
2007Sandpile transience on the grid is polynomially bounded.Lszl Babai, Igor Gorodezky
2007Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.Baruch Awerbuch, Rohit Khandekar, Satish Rao
2007Path-independent load balancing with unreliable machines.James Aspnes, Yang Richard Yang, Yitong Yin
2007Zone diagrams: existence, uniqueness and algorithmic challenge.Tetsuo Asano, Jir Matousek, Takeshi Tokuyama
2007k-means++: the advantages of careful seeding.David Arthur, Sergei Vassilvitskii
2007Compressing rectilinear pictures and minimizing access control lists.David L. Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang
2007On the separation and equivalence of paging strategies.Spyros Angelopoulos, Reza Dorrigiv, Alejandro Lpez-Ortiz
2007Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry.Spyros Angelopoulos
2007Instability of FIFO in the permanent sessions model at arbitrarily small network loads.Matthew Andrews
2007Strong price of anarchy.Nir Andelman, Michal Feldman, Yishay Mansour
2007Complexity of Delaunay triangulation for points on lower-dimensional polyhedra.Nina Amenta, Dominique Attali, Olivier Devillers
3,2763,300 of 4,977← PreviousNext →

Comparable venues

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