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
2011	Nearly Tight Bounds for Testing Function Isomorphism.	Sourav Chakraborty, David Garca-Soriano, Arie Matsliah
2011	Fast Information Spreading in Graphs with Large Weak Conductance.	Keren Censor-Hillel, Hadas Shachnai
2011	Dichotomy for Holant* Problems of Boolean Domain.	Jin-yi Cai, Pinyan Lu, Mingji Xia
2011	On Minmax Theorems for Multiplayer Games.	Yang Cai, Constantinos Daskalakis
2011	On Parity Check (0, 1)-Matrix over Z	Nader H. Bshouty, Hanna Mazzawi
2011	The Power of Nondeterminism in Self-Assembly.	Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki
2011	Streaming k-means on Well-Clusterable Data.	Vladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, Michael Shindler, Brian Tagiku
2011	Random Access to grammar-Compressed Strings.	Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2011	An Optimal Lower Bound for Buffer Management in Multi-Queue Switches.	Marcin Bienkowski
2011	Welfare Guarantees for Combinatorial Auctions with Item Bidding.	Kshipra Bhawalkar, Tim Roughgarden
2011	A Stackelberg Strategy for Routing Flow over Time.	Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
2011	Approximating Matrix p-norms.	Aditya Bhaskara, Aravindan Vijayaraghavan
2011	Improved Approximation Results for Stochastic Knapsack Problems.	Anand Bhalgat, Ashish Goel, Sanjeev Khanna
2011	Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions.	Aaron Bernstein, Liam Roditty
2011	Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures.	Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis
2011	Distributed Selfish Load Balancing on Networks.	Petra Berenbrink, Martin Hoefer, Thomas Sauerwald
2011	Randomized Diffusion for Indivisible Loads.	Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald
2011	Hitting time results for Maker-Breaker games.	Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
2011	Bayesian Incentive Compatibility via Fractional Assignments.	Xiaohui Bei, Zhiyi Huang
2011	Prize-collecting Steiner Problems on Planar Graphs.	MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dniel Marx
2011	Dimensionality reduction: Beyond the Johnson-Lindenstrauss bound.	Yair Bartal, Ben Recht, Leonard J. Schulman
2011	Fast, precise and dynamic distance queries.	Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty
2011	Subsampling Mathematical Relaxations and Average-case Complexity.	Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer
2011	Code Equivalence and Group Isomorphism.	Lszl Babai, Paolo Codenotti, Joshua A. Grochow, Youming Qiao
2011	Ranking with Submodular Valuations.	Yossi Azar, Iftah Gamzu

2,726–2,750 of 4,977← Previous Next →

Comparable venues

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