GI-Dagstuhl Seminar 02112
Algorithms for Memory Hierarchies
( Mar 10 – Mar 14, 2002 )
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/02112
Organizers
- Ulrich Carsten Meyer (Goethe-Universität - Frankfurt a. M., DE)
- Peter Sanders (KIT - Karlsruher Institut für Technologie, DE)
- Jop Frederik Sibeyn (University of Umeå, SE)
Contact
- Christian Breimann (Universität Münster, DE)
- Massimo Coppola (University of Pisa, IT)
- Stefan Edelkamp (Universität Bremen, DE) [dblp]
- Daniel Jimenez (UPC - Barcelona, ES)
- Juha Kärkkäinen (MPI für Informatik - Saarbrücken, DE) [dblp]
- Helmut G. Katzgraber (ETH Zürich, CH)
- Markus Kowarschik (Universität Erlangen-Nürnberg, DE)
- Piyush Kumar (SUNY - Stony Brook, US)
- Josep Lluis Larriba-Pey (UPC - Barcelona, ES) [dblp]
- Anil Maheshwari (Carleton University - Ottawa, CA)
- Ulrich Carsten Meyer (Goethe-Universität - Frankfurt a. M., DE) [dblp]
- Rasmus Pagh (IT University of Copenhagen, DK) [dblp]
- Naila Rahman (University of Leicester, GB)
- Kay Salzwedel (Universität Paderborn, DE)
- Peter Sanders (KIT - Karlsruher Institut für Technologie, DE) [dblp]
- Srinivasa Rao Satti (University of Waterloo, CA) [dblp]
- Martin Schmollinger (Universität Tübingen, DE)
- Laura I. Toma (Bowdoin College - Brunswick, US) [dblp]
- Jan Vahrenhold (TU Dortmund, DE) [dblp]
- Norbert Zeh (Aarhus University, DK) [dblp]
