A list of papers accepted for presentation at SODA06 is now available here.
A limited number of student travel grants are available. Please click HERE for more information.
About the Symposium
If applying for a visa, please remember to allow ample time for the application process. See “Conference Information” for a link to the National Academies who can provide further information.
The 8th Workshop on Algorithm Engineering and Experiments (ALENEX06) and the 3rd Workshop on Analytic Algorithmics and Combinatorics (ANALCO06) will be held immediately preceding the conference, on January 21, at the same location.
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.
Themes and application areas include, but are not limited to, the following topics:
Combinatorics and other aspects of Discrete Mathematics such as:
other aspects of Computer Science such as:
and applications in the Sciences and Business such as: Biology, Physics, Manufacturing and Finance.
Jointly sponsored by ACM Special Interest Group on Algorithms and Computation Theory and SIAM Activity Group on Discrete Mathematics.
Cliff Stein (Chair), Columbia University
DHTML Menus by http://www.milonic.com/