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
2017Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs.Sergio Cabello
2017Make Up Your Mind: The Price of Online Queries in Differential Privacy.Mark Bun, Thomas Steinke, Jonathan R. Ullman
2017Computing the Frchet Distance between Real-Valued Surfaces.Kevin Buchin, Tim Ophelders, Bettina Speckmann
2017Simplex Transformations and the Multiway Cut Problem.Niv Buchbinder, Roy Schwartz, Baruch Weizman
2017Fair Coin Flipping: Tighter Analysis and the Many-Party Case.Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2017Untitled recordNiv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon
2017Partial and Constrained Level Planarity.Guido Brckner, Ignaz Rutter
2017A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum.Karl Bringmann
2017ETH Hardness for Densest-Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein
2017An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs.Michele Borassi, Pierluigi Crescenzi, Luca Trevisan
2017An Efficient Representation for Filtrations of Simplicial Complexes.Jean-Daniel Boissonnat, Karthik C. S.
2017Linear Size Distance Preservers.Greg Bodwin
2017Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits.Lucas Boczkowski, Amos Korman, Emanuele Natale
2017Opting Into Optimal Matchings.Avrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia, Eviatar B. Procaccia, Rohit Vaish
2017Tight Bounds for Online TSP on the Line.Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meiner, Kevin Schewior, Miriam Schlter, Leen Stougie
2017Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover inSayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
2017Approximately Sampling Elements with Fixed Rank in Graded Posets.Prateek Bhakta, Ben Cousins, Matthew Fahrbach, Dana Randall
2017Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs.Aaron Bernstein, Shiri Chechik
2017Linear Diophantine Equations, Group CSPs, and Graph Isomorphism.Christoph Berkholz, Martin Grohe
2017Optimization of Bootstrapping in Circuits.Fabrice Benhamouda, Tancrde Lepoint, Claire Mathieu, Hang Zhou
2017File Maintenance: When in Doubt, Change the Layout!Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montes
2017The Identity Problem for Matrix Semigroups in SLPaul C. Bell, Mika Hirvensalo, Igor Potapov
2017Find Your Place: Simple Distributed Algorithms for Community Detection.Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
2017Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube.Paul Beame, Cyrus Rashtchian
2017Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits.Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson
1,8761,900 of 4,977← PreviousNext →

Comparable venues

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