ACM/SIAM Symposium on Discrete Algorithms

Resumen General

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 the design and analysis of efficient algorithms and data structures for discrete problems. The scope includes theoretical analysis, as well as experimental validation, of discrete algorithms, 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. Included Themes: Aspects of combinatorics and discrete mathematics, such as: Combinatorial structures, Discrete optimization, Graph theory, Random structures. Core topics in discrete algorithms, such as: Algorithm analysis, Data structures, Experimental algorithmics, Lower bounds, Mathematical programming. Algorithmic aspects of other areas of computer science, such as: Algorithmic fairness, Combinatorial scientific computing, Communication networks and the internet, Computational geometry and topology, Computer systems, Cryptography, security, and privacy, Databases and information retrieval, Distributed and parallel computing, Game theory and mechanism design, Machine learning, Quantum computing, Scheduling and resource allocation.

Clasificación de la Fuente

Mapa