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
2003On the performance of user equilibria in traffic networks.Andreas S. Schulz, Nicols E. Stier Moses
2003A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovsz Local Lemma.Mohammad R. Salavatipour
2003Pursuit-evasion with imprecise target location.Gnter Rote
2003A faster and simpler fully dynamic transitive closure.Liam Roditty
2003Online paging with arbitrary associativity.Enoch Peserico
2003Equitable colorings with constant number of colors.Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka
2003Lower bounds for collusion-secure fingerprinting.Chris Peikert, Abhi Shelat, Adam D. Smith
2003Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs.Hung Q. Ngo, Van H. Vu
2003Inferring tree topologies using flow tests.S. Muthukrishnan, Torsten Suel, Radek Vingralek
2003Rangesum histograms.S. Muthukrishnan, Martin Strauss
2003Data streams: algorithms and applications.S. Muthukrishnan
2003Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time.Christian Worm Mortensen
2003Improved bounds on the average length of longest common subsequences.George S. Lueker
2003Deterministic identity testing for multivariate polynomials.Richard J. Lipton, Nisheeth K. Vishnoi
2003The similarity metric.Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitnyi
2003Approximating asymmetric maximum TSP.Moshe Lewenstein, Maxim Sviridenko
2003A note on the set systems used for broadcast encryption.Ravi Kumar, Alexander Russell
2003Property testing of data dimensionality.Robert Krauthgamer, Ori Sasson
2003Between O(nm) and O(n alpha).Dieter Kratsch, Jeremy P. Spinrad
2003Certifying algorithms for recognizing interval graphs and permutation graphs.Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
2003On the complexity of distance-based evolutionary tree reconstruction.Valerie King, Li Zhang, Yunhong Zhou
2003Data migration to minimize the average completion time.Yoo Ah Kim
2003Root comparison techniques applied to computing the additively weighted Voronoi diagram.Menelaos I. Karavelas, Ioannis Z. Emiris
2003Selection with monotone comparison cost.Sampath Kannan, Sanjeev Khanna
2003A 5/4-approximation algorithm for minimum 2-edge-connectivity.Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan
3,7263,750 of 4,977← PreviousNext →

Comparable venues

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