SODA is sponsored by the SIAM Activity Group on Discrete Mathematics and the ACM Special Interest Group on Algorithms and Computation Theory.

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.

The following meetings will be held jointly:
ACM-SIAM Symposium on Discrete Algorithms (SODA22)
Algorithm Engineering and Experiments (ALENEX22)
SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS22)
SIAM Symposium on Simplicity in Algorithms (SOSA22)

Included Themes

Aspects of combinatorics and discrete mathematics, such as:

    Combinatorial structures
    Discrete optimization
    Discrete probability
    Finite metric spaces
    Graph theory
    Mathematical programming
    Random structures
    Topological problems 

Core topics in discrete algorithms, such as:

    Algorithm analysis
    Data structures
    Experimental algorithmics 

Algorithmic aspects of other areas of computer science, such as:

    Combinatorial scientific computing
    Communication networks and the Internet
    Computational geometry and topology
    Computer graphics and computer vision
    Computer systems
    Cryptography and security
    Databases and information retrieval
    Data compression
    Data privacy
    Distributed and parallel computing
    Game theory and mechanism design
    Machine learning
    Quantum computing