TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 9415

Expander Graphs, Random Graphs and Their Application in Computer Science

( Apr 11 – Apr 15, 1994 )

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/9415

Organizers
  • E. Upfal
  • F. Meyer a.d. Heide
  • H.J. Prömel



Summary

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.

Copyright

Participants
  • E. Upfal
  • F. Meyer a.d. Heide
  • H.J. Prömel