Algorithm Engineering and Experiments (ALENEX17) and Analytic Algorithmics and Combinatorics (ANALCO17) will take place at the same location, and will hold sessions during the SODA conference.
SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics. This conference is co-sponsored by Universitat Politècnica de Catalunya, Barcelona, Spain.
Themes and application areas include, but are not limited to, the following topics:
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
• Data compression
• Cryptography and security
• Databases and information retrieval
• Distributed and parallel computing
• Game theory and mechanism design
• Machine learning
• Quantum computing
Jan 16
2017
Jan 19
2017
Draft paper submission deadline
Registration deadline
2018-01-07 United States
ACM-SIAM Symposium on Discrete Algorithms2016-01-10 United States Arlington
ACM-SIAM Symposium on Discrete Algorithms2013-01-06 United States
ACM-SIAM Symposium on Discrete Algorithms (SODA13)
Submit Comment