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
Most published authors
SODA papers
4,977 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2017 | The ( | Nikhil Bansal, Marek Elis, Lukasz Jez, Grigorios Koumoutsos |
| 2017 | LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. | Nikhil Bansal, Daniel Reichman, Seeun William Umboh |
| 2017 | Better Approximations for Tree Sparsity in Nearly-Linear Time. | Arturs Backurs, Piotr Indyk, Ludwig Schmidt |
| 2017 | Online Lower Bounds via Duality. | Yossi Azar, Ilan Reuven Cohen, Alan Roytman |
| 2017 | Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. | Yossi Azar, Ashish Chiplunkar, Haim Kaplan |
| 2017 | High-dimensional approximate | Georgia Avarikioti, Ioannis Z. Emiris, Loukas Kavouras, Ioannis Psarros |
| 2017 | On Estimating Maximum Matching Size in Graph Streams. | Sepehr Assadi, Sanjeev Khanna, Yang Li |
| 2017 | Optimal Approximate Polytope Membership. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2017 | Eliminating Depth Cycles among Triangles in Three Dimensions. | Boris Aronov, Edward Y. Miller, Micha Sharir |
| 2017 | Algorithmic and Hardness Results for the Hub Labeling Problem. | Haris Angelidakis, Yury Makarychev, Vsevolod Oparin |
| 2017 | LSH Forest: Practical Algorithms Made Theoretical. | Alexandr Andoni, Ilya P. Razenshteyn, Negev Shekel Nosatzki |
| 2017 | Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. | Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten |
| 2017 | Optimal induced universal graphs for bounded-degree graphs. | Noga Alon, Rajko Nenadov |
| 2017 | Time-Space Trade-offs in Population Protocols. | Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest |
| 2017 | Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. | Thomas D. Ahle, Martin Aumller, Rasmus Pagh |
| 2017 | Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | Cross-Referenced Dictionaries and the Limits of Write Optimization. | Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai |
| 2017 | Firefighting on Trees Beyond Integrality Gaps. | David Adjiashvili, Andrea Baggio, Rico Zenklusen |
| 2017 | Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs. | David Adjiashvili |
| 2017 | Sample-Optimal Density Estimation in Nearly-Linear Time. | Jayadev Acharya, Ilias Diakonikolas, Jerry Li, Ludwig Schmidt |
| 2017 | Fully dynamic all-pairs shortest paths with worst-case update-time revisited. | Ittai Abraham, Shiri Chechik, Sebastian Krinninger |
| 2017 | Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. | Zachary Abel, Victor Alvarez, Erik D. Demaine, Sndor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer |
| 2017 | A Hierarchy of Lower Bounds for Sublinear Additive Spanners. | Amir Abboud, Greg Bodwin, Seth Pettie |
| 2017 | Geodesic Spanners for Points on a Polyhedral Terrain. | Mohammad Ali Abam, Mark de Berg, Mohammad Javad Rezaei Seraji |
| 2017 | pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems. | Arnab Ganguly, Rahul Shah, Sharma V. Thankachan |
1,901–1,925 of 4,977← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing
- AALENEXWorkshop on Algorithm Engineering and Experiments