Dagstuhl Seminar 9337
Parallel and Distributed Algorithms
( Sep 13 – Sep 17, 1993 )
Permalink
Organizers
- E.W. Mayr
- F. Meyer a.d. Heide
- R. Cole
Contact
The second Dagstuhl Seminar on Parallel and Distributed Algorithms was organized by Richard Cole (Courant Institute, New York), Ernst W. Mayr (TU München), and Friedhelm Meyer auf der Heide (Universität Paderborn). It brought together 25 participants from 6 countries, 7 of them came from overseas.
The 25 talks presented covered a wide range of topics including "parallel data structures, models of parallel computing, parallel complexity theory, and efficient algorithms for PRAMS, interconnection networks, and Boolean circuits, and randomization techniques for parallel algorithms.
The abstracts of all talks can be found in the Dagstuhl-Seminar-Report
An interesting guided excursion to the ancient Roman city, and therefore oldest German city, of Trier took place on Thursday.
The outstanding environment and organization of Schloß Dagstuhl greatly contributed to the success of the seminar.
- E.W. Mayr
- F. Meyer a.d. Heide
- R. Cole
Related Seminars
- Dagstuhl Seminar 9110: Parallel and Distributed Algorithms (1991-03-04 - 1991-03-08) (Details)
- Dagstuhl Seminar 9210: Parallel and Distributed Algorithms (1992-03-02 - 1992-03-06) (Details)
- Dagstuhl Seminar 9537: Parallel and Distributed Algorithms (1995-09-11 - 1995-09-15) (Details)
- Dagstuhl Seminar 9737: Parallel and Distributed Algorithms (1997-09-08 - 1997-09-12) (Details)
- Dagstuhl Seminar 99291: Parallel and Distributed Algorithms (1999-07-18 - 1999-07-23) (Details)