- Source: Symposium on Discrete Algorithms
- Algoritma greedy
- Konferensi SWAT dan WADS
- Algoritma
- Quicksort
- Daftar masalah matematika yang belum terpecahkan
- Particle swarm optimization
- Determinan
- Teorema ketunggalan Alexandrov
- Kalkulus diferensial Boolean
- Symposium on Discrete Algorithms
- Shortest path problem
- Fast Fourier transform
- Quantum random circuits
- Greedy algorithm
- Component (graph theory)
- Nearest neighbor search
- Independent set (graph theory)
- Graph coloring
- Priority queue
The Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) is an academic conference in the fields of algorithm design and discrete mathematics. It is considered to be one of the top conferences for research in algorithms. SODA has been organized annually since 1990, typically in January. SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) and the SIAM Activity Group on Discrete Mathematics, and in format is more similar to a theoretical computer science conference than to a mathematics conference.
History
The first Symposium on Discrete Algorithms was held in 1990 at San Francisco, organized by David Johnson.
In 2012, the ACM Special Interest Group on Algorithms and Computation Theory (ACM SIGACT) and SIAM Activity Group on Discrete Mathematics (SIAG/DM) jointly established SODA Steering Committee to work with SIAM and ACM on organizing SODA.