Campus Event Calendar
Event Entry
What and Who
Taming Randomness: From Physics to Efficient Algorithms
Tobias Friedrich
Max-Planck-Institut für Informatik - D1
Joint MPI-INF/MPI-SWS Lecture Series
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 11 January 2012
12:15
60 Minutes
E1 3 - Hörsaal Gebäude
002
Saarbrücken
Warning: New Room!
Abstract
Randomness is essential for understanding our physical world and is ubiquitous in our daily life. Randomness also plays a crucial role in algorithms research. In this talk, I will present a number of examples for the use of randomness in the design and analysis of algorithms. We start with the simulation of physical growth processes and random walks. Further examples will be discrete optimization, high-dimensional volume computation and distributed computing. The key ingredient will be the appropriate use of randomness. I will give several examples where the right dose of randomness makes algorithms both simpler and faster.
Contact
Jennifer Müller
2900
--email hidden
passcode not visible
logged in users only
Jennifer Müller, 01/05/2012 12:35
Jennifer Müller, 08/18/2011 09:49
Tobias Friedrich, 08/14/2011 22:19
Anna-Lisa Overhoff, 08/12/2011 10:25 -- Created document.
Jennifer Müller, 08/18/2011 09:49
Tobias Friedrich, 08/14/2011 22:19
Anna-Lisa Overhoff, 08/12/2011 10:25 -- Created document.