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
2018	Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can).	Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann
2018	On Simultaneous Two-player Combinatorial Auctions.	Mark Braverman, Jieming Mao, S. Matthew Weinberg
2018	Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy.	Joshua Brakensiek, Venkatesan Guruswami
2018	Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce.	Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Saeed Seddighin
2018	A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version.	Allan Borodin, Denis Pankratov, Amirali Salehi-Abari
2018	Optimal Vertex Fault Tolerant Spanners (for fixed stretch).	Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams
2018	Optimal streaming and tracking distinct elements with high probability.	Jaroslaw Blasiok
2018	Spatial Mixing and Non-local Markov chains.	Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda
2018	Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism.	Eric Blais, Clment L. Canonne, Talya Eden, Amit Levi, Dana Ron
2018	A	Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2018	Dynamic Algorithms for Graph Coloring.	Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai
2018	Near-optimal approximation algorithm for simultaneous Max-Cut.	Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari
2018	Online Bipartite Matching with Amortized Replacements.	Aaron Bernstein, Jacob Holm, Eva Rotenberg
2018	Incremental Topological Sort and Cycle Detection in Expected Total Time.	Aaron Bernstein, Shiri Chechik
2018	Simple and Efficient Leader Election.	Petra Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach
2018	Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs.	Petra Berenbrink, George Giakkoupis, Peter Kling
2018	A tight -approximation for Linear 3-Cut.	Kristf Brczi, Karthekeyan Chandrasekaran, Tams Kirly, Vivek Madan
2018	Estimating graph parameters via random walks with restarts.	Anna Ben-Hamou, Roberto I. Oliveira, Yuval Peres
2018	Comparing mixing times on sparse random graphs.	Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres
2018	Improved Bounds for Testing Forbidden Order Patterns.	Omri Ben-Eliezer, Clment L. Canonne
2018	From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games.	Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark
2018	Incremental DFS algorithms: a theoretical and experimental study.	Surender Baswana, Ayush Goel, Shahbaz Khan
2018	Approximate Single Source Fault Tolerant Shortest Path.	Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty
2018	Nested Convex Bodies are Chaseable.	Nikhil Bansal, Martin Bhm, Marek Elis, Grigorios Koumoutsos, Seeun William Umboh
2018	Competitive Algorithms for Generalized	Nikhil Bansal, Marek Elis, Grigorios Koumoutsos, Jesper Nederlof

1,701–1,725 of 4,977← Previous Next →

Comparable venues

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