Symposium: Probability and Algorithms

Symposium on

Probability and Algorithms

Friday September 26, 2003
Department of Mathematical Sciences (Staff Lounge), University of Aarhus

Organizer:

Søren Asmussen (MaPhySto, University of Aarhus)

Abstract:

The topic of the symposium is the interface between probability theory and computer science. Some selected topics in this area are probabilistic analysis of algorithms, randomized algorithms, computational methods in applied probability, and Markov chain Monte Carlo with applications to statistics and mathemathical physics.

Programme:

9:00-9:45	Rudolph Grubel: Node depth distribution in binary search trees
9:45-10:20	Hans-Peter Schwefel: Performance modeling of future communication systems: achievements and new challenges
10:20-10:50	Coffee/tea break
10:50-11:35	Peter Bro Miltersen: An Introduction to Extractors
11:35-12:15	Steffen Lauritzen: Local computation algoritms in probability
12:15-13:30	Lunch
13:30-14:15	Uwe Roessler: Quickselect revisited
14:15-15:00	Ludger Rueschendorf: Asymptotics of recursive algorithms by the contraction method
15:00-15:20	Fredrik Lundin: Omniparametric simulation for the two-type Richardson model
15:20-15:40	Coffee/tea break
15:40-16:30	Eva B. Vedel Jensen: Statistical Inference for Locally Scaled Point Processes
16:30-17:10	Olle Haeggstroem: Threshold phenomena, MCMC convergence, and related monotinicity issues in probability theory
17:10-17:30	Søren Asmussen: Erlang extrapolation for ruin probabilities

Other participants:

Niels Christian Bach (University of Aarhus), Kristoffer Arnsfelt Hansen (University of Aarhus), Torben Lauritzen (University of Aarhus), Rodrigo Labouriau, Lasse Westh-Nielsen (University of Aarhus), Henrik Sandmann (University of Aarhus).

Symposium dinner

Will be held at Restaurant Navigator.