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.
Themes and application areas include, but are not limited to, the following topics:
2018-01-07 United StatesACM-SIAM Symposium on Discrete Algorithms
2017-01-16 Spain BarcelonaSymposium on Discrete Algorithms
2013-01-06 United StatesACM-SIAM Symposium on Discrete Algorithms (SODA13)