Campus Event Calendar
Event Entry
New for: D3
What and Who
Randomized Phone Chains
Benjamin Doerr
Max-Planck-Institut für Informatik - D1
Joint MPI-INF/MPI-SWS Lecture Series
AG 1, AG 3, AG 4, AG 5, SWS, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 5 May 2010
16:00
60 Minutes
E1 4
024
Saarbrücken
Abstract
The telephone chain problem, both in computer networks and in
real life, is to spread a news originating in one location to all
others. In the talk, I present a few simple protocols for this problem.
As it turns out, protocols sending the news to random destinations are
surprisingly good. What is the right dose of randomness, however, is a
tricky question of current interest, also for other algorithmic problems.
real life, is to spread a news originating in one location to all
others. In the talk, I present a few simple protocols for this problem.
As it turns out, protocols sending the news to random destinations are
surprisingly good. What is the right dose of randomness, however, is a
tricky question of current interest, also for other algorithmic problems.
Contact
Jennifer Mueller
900
--email hidden
passcode not visible
logged in users only
Jennifer Müller, 02/23/2010 13:02
Anna-Lisa Overhoff, 02/17/2010 13:31 -- Created document.
Anna-Lisa Overhoff, 02/17/2010 13:31 -- Created document.