This symposium focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.
Algorithm Engineering and Experiments (ALENEX19), Analytic Algorithmics and Combinatorics (ANALCO19), and Symposium on Simplicity in Algorithms (SOSA19) will take place at the same location and will hold sessions during the SODA conference.
SODA is jointly sponsored by the SIAM Activity Group on Discrete Mathematics and the ACM Special Interest Group on Algorithms and Computation Theory.
January 6-9, 2018
The Westin San Diego
400 West Broadway
San Diego, CA, 92101, USA