Expander Graphs, Random Graphs and Their Application in Computer Science (Dagstuhl Seminar 9415)
Fridhelm Meyer auf der Heide, Hans Jürgen Prömel, Uli Upfal · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 1994
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 this seminar report.An interesting excursion to Trier, one of the oldest German cities, took place on Wednesday.