Discrete Algorithms

This symposium, held in Baltimore, Maryland in January 1999, is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group of Discrete Mathematics. It concerns research on the use, design and analysis of efficient algorithms and data structures, and on the mathematical problems related to the development and analysis of discrete algorithms. Performance analysis may be analytical or experimental and may address worst-case or average-case performance. These studies can be theoretical or based on real datasets; they may also address methodological issues involved in performance analysis.

Application areas include, but are not limited to: discrete mathematics and combinatorics; combinatorial structures; communication networks; computational graphics and vision; computer systems; cryptography and security; databases and information retrieval; discrete optimization and probability; distributed and experimental algorithms; graph drawing; graphs and networks; machine learning; mathematical programming; molecular computing; number theory and algebra; online problems; pattern matching and data compression; quantum computing; random structures; robotics; statistical inference; and symbolic computation.