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.[1] SODA has been organized annually since 1990, typically in January.[2] 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.[3]
^For instance, SODA is the only conference with the top A* ranking in the 2023 CORE Rankings of algorithms conferences.
^Symposium on Discrete Algorithms (SODA), DBLP, retrieved 2017-12-11
^Winkler, Peter, How (and Why!) to Write a SODA Paper. Distributed by Howard Karloff with the call for papers for SODA 1998.
and 22 Related for: Symposium on Discrete Algorithms information
The Annual ACM-SIAM SymposiumonDiscreteAlgorithms (SODA) is an academic conference in the fields of algorithm design and discrete mathematics. It is...
and Practical Algorithm for Sparse Fourier Transform" (PDF). ACM-SIAM SymposiumonDiscreteAlgorithms. Archived (PDF) from the original on 2012-03-04....
sieving." Proceedings of the twenty-seventh annual ACM-SIAM symposiumonDiscretealgorithms (pp. 10-24). Society for Industrial and Applied Mathematics...
branch-and-bound algorithm. There are a few variations to the greedy algorithm: Pure greedy algorithms Orthogonal greedy algorithms Relaxed greedy algorithms Greedy...
G-colourable graphs", Proceedings of the Thirty-First Annual ACM-SIAM SymposiumonDiscreteAlgorithms, pp. 1426–1435 Yates, F. (1937), The design and analysis of...
tree, parallel connectivity, and set maxima algorithms", Proc. 13th ACM-SIAM SymposiumonDiscreteAlgorithms (SODA '02), San Francisco, California, pp...
central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix...
acyclic graphs", Proceedings of the Twelfth Annual ACM-SIAM SymposiumonDiscreteAlgorithms (SODA '01), Philadelphia, PA, USA: Society for Industrial and...
multisets". Proceedings of the thirteenth annual ACM-SIAM symposiumonDiscretealgorithms. pp. 233–242. arXiv:0705.0552. CiteSeerX 10.1.1.246.3123. doi:10...
Exponential Time Algorithms for the Shortest Vector Problem". Proceedings of the Twenty-First Annual ACM-SIAM SymposiumonDiscreteAlgorithms. SODA '10. Philadelphia...
International Computer Science Symposium in Russia (CSR) ACM–SIAM SymposiumonDiscreteAlgorithms (SODA) IEEE Symposiumon Logic in Computer Science (LICS)...
produced with sophisticated algorithms. In addition, many approximation algorithms exist. For example, the first fit algorithm provides a fast but often...
(1998), "Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication", Proceedings of the 9th SymposiumonDiscreteAlgorithms (SODA): 446–452...
(jointly sponsored by SIGGRAPH), until 2014 SODA: ACM/SIAM SymposiumonDiscreteAlgorithms (jointly sponsored by the Society for Industrial and Applied...
N. (ed.). Proceedings of the Twenty-Eighth Annual ACM-SIAM SymposiumonDiscreteAlgorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19...
the journal also invites selected papers from the ACM-SIAM SymposiumonDiscreteAlgorithms (SODA). The journal is abstracted and indexed in the Science...
perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals...
"Algorithms for k-colouring and finding maximal independent sets", Proceedings of the Fourteenth Annual ACM-SIAM SymposiumonDiscreteAlgorithms, Soda...
Global Information