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
2019	Towards Instance-Optimal Private Query Release.	Jaroslaw Blasiok, Mark Bun, Aleksandar Nikolov, Thomas Steinke
2019	The I/O complexity of Toom-Cook integer multiplication.	Gianfranco Bilardi, Lorenzo De Stefani
2019	Improving the smoothed complexity of FLIP for max cut problems.	Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
2019	Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness.	Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani
2019	Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time.	Sayan Bhattacharya, Janardhan Kulkarni
2019	A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials.	Vishwas Bhargava, Markus Blser, Gorav Jindal, Anurag Pandey
2019	A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.	Aaron Bernstein, Sebastian Forster, Monika Henzinger
2019	A time- and space-optimal algorithm for the many-visits TSP.	Andr Berger, Lszl Kozma, Matthias Mnich, Roland Vincze
2019	Optimal Ball Recycling.	Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai
2019	Correlation-Robust Analysis of Single Item Auction.	Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang
2019	Stochastic Matching with Few Queries: New Algorithms and Tools.	Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani
2019	Hardness of Approximation for Morse Matching.	Ulrich Bauer, Abhishek Rathod
2019	Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs.	MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi
2019	A tight Erdős-Psa function for planar minors.	Wouter Cames van Batenburg, Tony Huynh, Gwenal Joret, Jean-Florent Raymond
2019	Asymmetric Convex Intersection Testing.	Luis Barba, Wolfgang Mulzer
2019	On the discrepancy of random low degree set systems.	Nikhil Bansal, Raghu Meka
2019	A PTAS for ℓp-Low Rank Approximation.	Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff
2019	Dynamic Double Auctions: Towards First Best.	Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo
2019	An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.	Eric Balkanski, Aviad Rubinstein, Yaron Singer
2019	Testing Matrix Rank, Optimally.	Maria-Florina Balcan, Yi Li, David P. Woodruff, Hongyang Zhang
2019	Full Tilt: Universal Constructors for General Shapes with Uniform External Forces.	Jose Balanza-Martinez, Austin Luchsinger, David Caballero, Rene Reyes, Angel A. Cantu, Robert Schweller, Luis Angel Garcia, Tim Wylie
2019	Fast Modular Subset Sum using Linear Sketching.	Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu
2019	Fully Dynamic Maximal Independent Set with Sublinear in n Update Time.	Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2019	Sublinear Algorithms for (Δ + 1) Vertex Coloring.	Sepehr Assadi, Yu Chen, Sanjeev Khanna
2019	Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs.	Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein

1,501–1,525 of 4,977← Previous Next →

Comparable venues

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