ACM/SIAM Symposium on Discrete Algorithms

SODA

CORE rank

CORE rank (raw)

Acceptance rate

32.0% (2024)

Fields of research

Theory of Computation

Papers indexed

4,977

1990–2026

Best Theory of Computation conferences

Papers per year

1990243 peak2026

Most published authors

SODA papers

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

Year	Title	Authors
2023	Tiny Pointers.	Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini
2023	On complex roots of the independence polynomial.	Ferenc Bencs, Pter Csikvri, Piyush Srivastava, Jan Vondrk
2023	Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time	Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2023	Polynomial formulations as a barrier for reduction-based hardness proofs.	Tatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Denil Sharipov
2023	Bidder Subset Selection Problem in Auction Design.	Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang
2023	Beating Greedy Matching in Sublinear Time.	Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2023	Single-Pass Streaming Algorithms for Correlation Clustering.	Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan
2023	Dynamic Algorithms for Maximum Matching Size.	Soheil Behnezhad
2023	Sampling Equilibria: Fast No-Regret Learning in Structured Games.	Daniel Beaglehole, Max Hopkins, Daniel Kane, Sihan Liu, Shachar Lovett
2023	Optimal Fully Dynamic	MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
2023	Optimal Deterministic Massively Parallel Connectivity on Forests.	Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto
2023	Distributed Maximal Matching and Maximal Independent Set on Hypergraphs.	Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
2023	Tight Bounds for Monotone Minimal Perfect Hashing.	Sepehr Assadi, Martin Farach-Colton, William Kuszmaul
2023	Economical Convex Coverings and Applications.	Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2023	Quantum tomography using state-preparation unitaries.	Joran van Apeldoorn, Arjan Cornelissen, Andrs Gilyn, Giacomo Nannicini
2023	Fast algorithms for solving the Hamilton Cycle problem with high probability.	Michael Anastos
2023	The Need for Seed (in the abstract Tile Assembly Model).	Andrew Alseth, Matthew J. Patitz
2023	Smaller Low-Depth Circuits for Kronecker Powers.	Josh Alman, Yunfeng Guan, Ashwin Padaki
2023	Computing Square Colorings on Bounded-Treewidth and Planar Graphs.	Akanksha Agrawal, Dniel Marx, Daniel Neuen, Jasper Slusallek
2023	Online Sorting and Translational Packing of Convex Polygons.	Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist
2023	Query Complexity of the Metric Steiner Tree Problem.	Yu Chen, Sanjeev Khanna, Zihan Tan
2023	Deterministic counting Lovsz local lemma beyond linear programming.	Kun He, Chunyang Wang, Yitong Yin
2023	Improved Bounds for Sampling Solutions of Random CNF Formulas.	Kun He, Kewen Wu, Kuan Yang
2023	Moser-Tardos Algorithm: Beyond Shearer's Bound.	Kun He, Qian Li, Xiaoming Sun
2023	Equivalence Test for Read-Once Arithmetic Formulas.	Nikhil Gupta, Chandan Saha, Bhargav Thankey

776–800 of 4,977← Previous Next →

Comparable venues

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