NEW!

The SODA05 program is now available here.

Student Travel Grants
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 information about entering Canada.

The 7th Workshop on Algorithm Engineering and Experiments (ALENEX05) and the 2nd Workshop on Analytic Algorithmics and Combinatorics (ANALCO05) will be held immediately preceding the conference at the same location.

Description

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

Themes and application areas include, but are not limited to, the following topics:

Combinatorics and other aspects of Discrete Mathematics such as:

  • Algebra
  • Combinatorial Structures
  • Discrete Optimization
  • Discrete Probability
  • Graph Drawing
  • Graphs and Networks
  • Mathematical Programming
  • Number Theory
  • Random Structures

other aspects of Computer Science such as:

  • Communication Networks
  • Computational Geometry
  • Computer Graphics and Computer Vision
  • Computer Systems
  • Cryptography and Security
  • Data Compression
  • Databases and Information Retrieval
  • Distributed Algorithms
  • Experimental Algorithmics
  • Internet Algorithmics
  • Machine Learning
  • On-line Problems
  • Quantum Computing
  • Pattern Matching
  • Robotics
  • Symbolic Computation

and applications in the Sciences and Business such as: Biology, Physics, and Finance.

Sponsor

Jointly sponsored by ACM Special Interest Group on Algorithms and Computation Theory and SIAM Activity Group on Discrete Mathematics

Program Committee

Yossi Azar, Tel Aviv University, Israel
Adam Buchsbaum (chair), AT&T Labs- Research
Bernard Chazelle, Princeton University
Richard Cole, Courant Institute of Mathematical Sciences, New York University
Lisa Fleischer, IBM T.J. Watson Research Center
Mordecai Golin, The Hong Kong University of Science & Technology, Hong Kong
Michael Goodrich, University of California, Irvine
Roberto Grossi, University of Pisa, Italy
Sudipto Guha, University of Pennsylvania
Magnus M. Halldorsson, University of Iceland
Piotr Indyk, Massachusetts Institute of Technology
Giuseppe F. Italiano, University of Rome "Tor Vergata,” Italy
Haim Kaplan, Tel Aviv University, Israel
Wendy Myrvold, University of Victoria, Canada
Kirk Pruhs, University of Pittsburgh
Dana Randall, Georgia Institute of Technology
Satish Rao, University of California, Berkeley
Bruce Shepherd, Bell Laboratories, Lucent Technologies
Eric Torng, Michigan State University
Santosh Vempala, Massachusetts Institute of Technology
Suresh Venkatasubramanian, AT&T Labs - Research
Van Vu, University of California, San Diego
Nick Wormald, University of Waterloo, Canada

 

 


Last Edited: 10/1/04
Created 3/18/04
DHTML Menus by http://www.milonic.com/