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
2016Linear Recognition of Almost Interval Graphs.Yixin Cao
2016Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions.Sarah Cannon, Dana Randall
2016New Bounds for Approximating Extremal Distances in Undirected Graphs.Massimo Cairo, Roberto Grossi, Romeo Rizzi
2016An improved bound on the fraction of correctable deletions.Boris Bukh, Venkatesan Guruswami
2016Deterministic Algorithms for Submodular Maximization Problems.Niv Buchbinder, Moran Feldman
2016Recovery and Rigidity in a Regular Stochastic Block Model.Gerandy Brito, Ioana Dumitriu, Shirshendu Ganguly, Christopher Hoffman, Linh V. Tran
2016Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions.Mark Braverman, Jieming Mao, S. Matthew Weinberg
2016Clustering Problems on Sliding Windows.Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh
2016The matching problem has no small symmetric SDP.Gbor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink
2016Efficient Low-Redundancy Codes for Correcting Multiple Deletions.Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky
2016Algorithmic Complexity of Power Law Networks.Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski
2016On the Economic Efficiency of the Combinatorial Clock Auction.Nicolas Bousquet, Yang Cai, Christoph Hunkenschrder, Adrian Vetta
2016Better Distance Preservers and Additive Spanners.Greg Bodwin, Virginia Vassilevska Williams
2016Sparse Approximation via Generating Point Sets.Avrim Blum, Sariel Har-Peled, Benjamin Raichel
2016Subexponential parameterized algorithm for Interval Completion.Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2016Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems.Ivan Bliznets, Marek Cygan, Pawel Komosa, Luks Mach, Michal Pilipczuk
2016Random-Cluster Dynamics in ℤAntonio Blanca, Alistair Sinclair
2016Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields.Jean-Franois Biasse, Fang Song
2016Faster Fully Dynamic Matchings with Small Approximation Ratios.Aaron Bernstein, Cliff Stein
2016Blocking OptimalAttila Bernth, Tams Kirly
2016Robust positioning patterns.Ross Berkowitz, Swastik Kopparty
2016How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness.Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young
2016Range Predecessor and Lempel-Ziv Parsing.Djamal Belazzougui, Simon J. Puglisi
2016New directions in nearest neighbor searching with applications to lattice sieving.Anja Becker, Lo Ducas, Nicolas Gama, Thijs Laarhoven
2016Stabilizing Consensus with Many Opinions.Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
2,0262,050 of 4,977← PreviousNext →

Comparable venues

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