Second International Workshop on Combinatorial Scientific Computing (CSC05)
June 21–23th, 2005
CERFACS, Toulouse, France
The Second International Workshop on Combinatorial Scientific Computing (CSC05) will provide a forum for researchers interested in the interaction of combinatorial mathematics and algorithms with scientific computing to discuss current developments in research.
CSC05 follows the pioneering SIAM Workshop on Combinatorial Scientific Computing (CSC04) held at San Francisco in Feb 2004. The CSC04 Workshop, attended by close to a hundred participants, featured three plenary talks and 21 selected talks on the themes of sparse matrix computations, high-performance algorithms, combinatorial problems in optimization and automatic differentiation, mesh generation, computational biology, and combinatorial matrix theory. The CSC05 Workshop aims to bring together researchers interested in these themes as well as other aspects of combinatorial mathematics and algorithms in scientific computing, broadly interpreted. Researchers in emerging application areas as well as theoretical areas that intersect with combinatorial scientific computing, e.g., information science, networks, bioinformatics, and combinatorial optimization, are invited to participate.
Students are very much encouraged to participate. Low registration fees (that include the lunches and the coffee breaks) are offered and a limited number of grants to support their local accomodation are also available.Program Schedule
The program schedule is available. Click here to view program.
Organizing Committee
Iain S. Duff (CERFACS, France and Rutherford Appleton Lab, UK)
John Gilbert (University of California, Santa Barbara, USA)
Alex Pothen (Old Dominion University, Norfolk, USA)
Patrick R. Amestoy (IRIT, Toulouse and ScAlApplix, INRIA, France)
Rob Bisseling (University of Utrecht, The Netherlands)
Andreas Griewank (Humboldt University, Berlin, Germany)
Jean-Yves L’Excellent (INRIA, Lyon, France)
Cynthia A. Phillips (Sandia National Labs, Albuquerque, USA)
Bryan Shader (University of Wyoming, Laramie, USA)
Industrial track coordinator
Jean Roman (LaBRI, INRIA Futurs, France)
Local Committee
Patrick R. Amestoy (IRIT, Toulouse and ScAlApplix, INRIA, France)
Iain S. Duff (CERFACS, France and Rutherford Appleton Lab, UK)
Luc Giraud (CERFACS, France)
Serge Gratton (CERFACS, France)
Brigitte Yzel (Administration)
Invited Speakers
Stanley C. Eisenstat (Yale University, U.S.A.) The elimination tree of a nonsymmetric matrix: theory and applications
Dan Halperin (Tel Aviv University, Tel Aviv, Israel) Controlled perturbation for certified geometric computing with fixed precision arithmetic
Denis Trystram (IMAG, Grenoble, France) Efficient algorithms for scheduling the tasks of parallel programs
