This symposium focuses on research topics related to design and analysis of efficient algorithms and data structures for discrete problems.
The scope includes theoretical analysis, as well as experimental validation, and the mathematical problems related to their development or limitations. The scope also includes aspects of combinatorics and discrete mathematics related to discrete algorithms. Papers that raise important algorithmic problems that can benefit from theoretical investigation and analysis, are encouraged.
The following meetings will be held jointly:
ACM-SIAM Symposium on Discrete Algorithms (SODA23)
Algorithm Engineering and Experiments (ALENEX23)
SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS23)
SIAM Symposium on Simplicity in Algorithms (SOSA23)