Dagstuhl-Seminar 09061
Combinatorial Scientific Computing
( 01. Feb – 06. Feb, 2009 )
(zum Vergrößern in der Bildmitte klicken)
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/09061
Organisatoren
- Uwe Naumann (RWTH Aachen, DE)
- Olaf Schenk (Universität Basel, CH)
- Horst D. Simon (Lawrence Berkeley National Laboratory, US)
- Sivan Toledo (Tel Aviv University, IL)
Kontakt
- Annette Beyer (für administrative Fragen)
Press Review
-
Vom Problem über den Graphen zum Hochleistungsrechner.
Wolfgang Back und Wolfgang Rudolph vom Computerclub Zwei im Gespräch mit Prof. Uwe Naumann.
- high-performance scientific computing
- graphs, hypergraphs, and combinatorics
- algorithms and complexity
- large-scale optimization
The activities of the seminar focused on combinatorial issues in high-performance scientific computing. The activities included:
- eight one-hour invited talks
- thirteen 20-minute contributed talks by participants from seven countries
- six software tutorials
- three round table discussions
Participants also enjoyed one of two recreational activities in a free afternoon (a long hike or a trip to Trier). As usual in Dagstuhl seminars, participants also engaged in lively informal professional (and personal) discussions during breaks, at meal times, and late into the night in the cafeteria / the wine cellar.
Two of the organizers, Uwe Naumann and Olaf Schenk, are working on a proposal to CRC Press for publication of a special collection of articles on CombinatorialScientific Computing in their Chapman & Hall/CRC Computational Science series. The purpose of the book is to provide the first collection of references for a diverse community of researcher working in different aspects in the exiting field of CSC. The content is strongly motivated by this seminar including survey articles as well as tutorial-style software guides. Potential readers include graduate students, young researcher, scientists in mid-career, and senior investigators from both academia and industry. Some are experts on graph combinatorial aspects, some are focusing on theoretical analysis, and some are more directed towards software development and concrete applications. Outreach into areas of science and engineering that face similar combinatorial problems as the CSC community is a major objective.
- Peter Arbenz (ETH Zürich, CH)
- Haim Avron (Tel Aviv University, IL)
- Cevdet Aykanat (Bilkent University - Ankara, TR) [dblp]
- David A. Bader (Georgia Institute of Technology - Atlanta, US) [dblp]
- Markus Beckers (RWTH Aachen, DE)
- Rob Bisseling (Utrecht University, NL) [dblp]
- Matthias Bollhöfer (TU Braunschweig, DE)
- Erik Boman (Sandia National Labs - Albuquerque, US) [dblp]
- Martin Bücker (RWTH Aachen, DE) [dblp]
- Ümit V. Çatalyürek (Ohio State University, US) [dblp]
- Tzu-Yi Chen (Pomona College - Claremont, US)
- Cedric Chevalier (Sandia National Labs - Albuquerque, US) [dblp]
- Matthias Christen (Universität Basel, CH) [dblp]
- Samuel Daitch (Yale University, US)
- Timothy Alden Davis (University of Florida - Gainesville, US) [dblp]
- Simplice Donfack (Université Paris Sud, FR) [dblp]
- Iain Duff (Rutherford Appleton Lab. - Didcot, GB)
- Assefaw H. Gebremedhin (Purdue University - West Lafayette, US)
- John Gilbert (University of California - Santa Barbara, US) [dblp]
- Laura Grigori (Université Paris Sud, FR)
- Bruce Hendrickson (Sandia National Labs - Albuquerque, US) [dblp]
- Jun-Ho Her (INRIA - Saclay, FR)
- Paul D. Hovland (Argonne National Laboratory, US) [dblp]
- Yifan Hu (AT&T Labs Research - Florham Park, US) [dblp]
- Frank Hülsemann (EDF - Clamart, FR)
- Johannes Langguth (University of Bergen, NO) [dblp]
- Xiaoye Sherry Li (Lawrence Berkeley National Laboratory, US) [dblp]
- Robert Luce (TU Berlin, DE)
- Andrew Lyons (Argonne National Laboratory, US)
- Michael Mahoney (Stanford University, US)
- Fredrik Manne (University of Bergen, NO) [dblp]
- Viktor Mosenkis (RWTH Aachen, DE) [dblp]
- Uwe Naumann (RWTH Aachen, DE) [dblp]
- Esmond Ng (Lawrence Berkeley National Laboratory, US)
- Md. Mostofa Ali Patwary (University of Bergen, NO)
- Francois Pellegrini (LaBRI - INRIA Bordeaux, FR) [dblp]
- Ali Pinar (Sandia Nat. Labs - Livermore, US) [dblp]
- Alex Pothen (Purdue University - West Lafayette, US) [dblp]
- Padma Raghavan (Pennsylvania State University - University Park, US) [dblp]
- John K. Reid (Rutherford Appleton Lab. - Didcot, GB)
- Stefan Reitzinger (CST AG - Darmstadt, DE)
- Jan Riehme (University of Hertfordshire, GB) [dblp]
- Ulrich Rüde (Universität Erlangen-Nürnberg, DE) [dblp]
- Ilya Safro (Argonne National Laboratory, US) [dblp]
- Peter Sanders (KIT - Karlsruher Institut für Technologie, DE) [dblp]
- Madan Sathe (Universität Basel, CH)
- Olaf Schenk (Universität Basel, CH) [dblp]
- Jennifer Scott (Rutherford Appleton Lab. - Didcot, GB)
- Trond Steihaug (University of Bergen, NO)
- Sivan Toledo (Tel Aviv University, IL) [dblp]
- Bora Uçar (ENS - Lyon, FR) [dblp]
- Jean Utke (Argonne National Laboratory, US) [dblp]
- Ruud van der Pas (Sun Labs - Oracle - Menlo Park, US)
- Ebadollah Varnik (RWTH Aachen, DE)
- Andreas Wächter (IBM TJ Watson Research Center, US)
- Andrea Walther (Universität Paderborn, DE) [dblp]
- Albert-Jan Yzelman (Utrecht University, NL) [dblp]
Klassifikation
- modelling / simulation
- data structures / algorithms / complexity
- optimization / scheduling
- programming languages / compiler
- combinatorial scientific computing
Schlagworte
- graphs
- combinatorics
- high-performance scientific computing
