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 |
|---|---|---|
| 2012 | Confluent persistence revisited. | Sbastien Collette, John Iacono, Stefan Langerman |
| 2012 | The condensation transition in random hypergraph 2-coloring. | Amin Coja-Oghlan, Lenka Zdeborov |
| 2012 | Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. | Josef Cibulka, Jan Kyncl |
| 2012 | Approximation algorithms and hardness of the | Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou |
| 2012 | Random walks, electric networks and the transience class problem of sandpiles. | Ayush Choure, Sundar Vishwanathan |
| 2012 | Linear index coding via semidefinite programming. | Eden Chlamtac, Ishay Haviv |
| 2012 | Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2012 | LSH-preserving functions and their applications. | Flavio Chierichetti, Ravi Kumar |
| 2012 | Voting with limited information and many alternatives. | Flavio Chierichetti, Jon M. Kleinberg |
| 2012 | Approximating rooted Steiner networks. | Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta |
| 2012 | Submodular functions are noise stable. | Mahdi Cheraghchi, Adam R. Klivans, Pravesh Kothari, Homin K. Lee |
| 2012 | Constructing high order elements through subspace polynomials. | Qi Cheng, Shuhong Gao, Daqing Wan |
| 2012 | Parallelism and time in hierarchical self-assembly. | Ho-Lin Chen, David Doty |
| 2012 | Optimal crowdsourcing contests. | Shuchi Chawla, Jason D. Hartline, Balasubramanian Sivan |
| 2012 | A little advice can be very helpful. | Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi |
| 2012 | An | Krishnendu Chatterjee, Monika Henzinger |
| 2012 | A faster algorithm to recognize even-hole-free graphs. | Hsien-Chih Chang, Hsueh-I Lu |
| 2012 | Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. | Timothy M. Chan, Elyot Grant, Jochen Knemann, Malcolm Sharpe |
| 2012 | Improved competitive ratio for the matroid secretary problem. | Sourav Chakraborty, Oded Lachish |
| 2012 | Computing all maps into a sphere. | Martin Cadek, Marek Krcl, Jir Matousek, Francis Sergeraert, Luks Vokrnek, Uli Wagner |
| 2012 | Partial match queries in random quadtrees. | Nicolas Broutin, Ralph Neininger, Henning Sulzbach |
| 2012 | Fully persistent B-trees. | Gerth Stlting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas |
| 2012 | Competitive routing in the half-θ | Prosenjit Bose, Rolf Fagerberg, Andr van Renssen, Sander Verdonschot |
| 2012 | Physarum can compute shortest paths. | Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma |
| 2012 | Fast zeta transforms for lattices with few irreducibles. | Andreas Bjrklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen |
2,576–2,600 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