Discrete Algorithms: Annual ACM-SIAM Symposium 11th

This symposium 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 methodological issues involved in performance analysis. Application areas include, but are not limited to, discrete mathematics and combinatorics; combinatorial structures; communication networks; computational biology, physics, finance, geometry and topology; computer 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.