Dagstuhl Seminar 9415
Expander Graphs, Random Graphs and Their Application in Computer Science
( Apr 11 – Apr 15, 1994 )
Permalink
Organizers
- E. Upfal
- F. Meyer a.d. Heide
- H.J. Prömel
Contact
The Dagstuhl Seminar on Expander Graphs, Random Graphs, and their Application in Computer Science was organized by Friedhelm Meyer auf der Heide (Universität Paderborn), Hans Jürgen Prömel (Universität Bonn), and Eli Upfal (IBM San José, Weizmann Institute). It brought together 26 participants from 8 countries, 5 of them came from overseas.
The 24 talks presented cover a wide range of topics including various properties of random graphs and expanders, randomized algorithms for allocation, scheduling or simulations, constructions of fault tolerant networks, local graph algorithms, probabilistic learning, and randomized Boolean circuits.
Abstracts of all talks as well as problems presented at the open problem session, chaired by Paul Erdös, are documented in the Dagstuhl-Seminar-Report.
An interesting excursion to Trier, one of the oldest German cities, took place on Wednesday.
The outstanding environment and organization of Schloß Dagstuhl greatly contributed to the success of the seminar.
- E. Upfal
- F. Meyer a.d. Heide
- H.J. Prömel