| Meeting | Analysis of Algorithms 2006 |
| Date | 2-8 July 2006 |
| Place | Alden Biesen, Belgium |
| Monday, July 3 | ||
| 9-10 am | Svante Janson: "The asymptotic distribution of the vertical profile of random trees" | |
| 10-10:30 am |  | |
| 10:30-11 am | Jean-François Marckert: "Discrete snakes" | |
| 11-11:30 am | Yuliy Baryshnikov: "Planar quantum random strolls" | |
| 11:30-12 am | Michael Drmota: "Cuckoo hashing revisited" | |
| 12-12:30 pm | Mordecai Golin: "TBA" | |
| 12:30-2:30 pm |       | |
| 2:30-3:30 pm | Philippe Chassaing: "TBA" | |
| 3:30-4 pm | | |
| 4-4:30 pm | Alexander Gnedin: "The chain records" | |
| 4:30-5 pm | Tsung-Hsi Tsai: "On the variance of the number of maxima in hypercubes" | |
| 7 pm |    | |
 |
| Tuesday, July 4 | ||
| 9-10 am | Guy Louchard: "The asymmetric leader election algorithm: another approach" | |
| 10-10:30 am | | |
| 10:30-11 am | Philippe Jacquet: "Common words between random strings" | |
| 11-11:30 am | Wojciech Szpankowski: "Precise analysis of the Tunstall code" | |
| 11:30-12 am | Markus Nebel: "On the lexicographical generation of compressed codes" | |
| 12-12:30 pm | Clemens Heuberger: "Counting redundant digit expansions of minimum weight" | |
| 12:30-2:30 pm | | |
| 2:30-3 pm | Brigitte Vallée: "Analysis of fast versions of Euclid's algorithm" | |
| 3-3:30 pm | Helmut Prodinger: "Analysis of skip lists: old and new" | |
| 3:30-4 pm | | |
| 4-4:30 pm | Michel Dekking: "Random Cantor sets and Palis' conjecture" | |
| 4:30-5 pm | Brigitte Chauvin: "Digital search trees and chaos game representation" | |
| 7 pm | | |
| World Cup (9 pm) |  | |
|
| Wednesday, July 5 | ||
| 9-10 am | Hsien-Kuei Hwang: "Profiles of random tries" | |
| 10-10:30 am | | |
| 10:30-11 am | Rudolf Grübel: "Statistical concepts in the analysis of algorithms" | |
| 11-11:30 am | Ludger Rüschendorf: "On recursive equations and processes" | |
| 11:30-12 am | Eva-Maria Schopp: "Exponential and polynomial tail bounds for recursive sequences" | |
| 12-12:30 pm | Jim Fill: "Precise logarithmic tail asymptotics for some limit random variables for random trees" | |
| 12:30-2:30 pm | | |
| free afternoon |    | |
| 7 pm | | |
| World Cup (9 pm) | | |
|
| Thursday, July 6 | ||
| 9-10 am | Bruce Reed: "Baby giants grow on trees" | |
| 10-10:30 am | | |
| 10:30-11 am | Mark Wilson: "The diameter of random Cayley graphs---multivariate asymptotics approach" | |
| 11-11:30 am | Conrado Martinez: "Analyzing intersection algorithms" | |
| 11:30-12 am | Kevin Compton: "TBA" | |
| 12-12:30 pm | Hosam Mahmoud: "Phase changes in subtree varieties in random trees" | |
| 12:30-2:30 pm | | |
| 2:30-3:30 pm | Philippe Flajolet: "Some exactly solvable models of urn process theory" | |
| 3:30-4 pm | | |
| 4-4:30 pm | Christoph Richard: "Punctured polygons" | |
| 4:30-5 pm | Antar Bandyopadhyay: "Counting without sampling. New algorithms for enumeration problems using statistical physics" | |
| banquet (7pm) |  | |
|
| Friday, July 7 | ||
| 9-10 am | Eric Demaine: "Adaptive analysis of algorithms: sets and curves" | |
| 10-10:30 am | | |
| 10:30-11 am | Alois Panholzer: "The left-right-imbalance of binary search trees and related questions" | |
| 11-11:30 am | Bernhard Gittenberger: "Hayman-admissible functions in several variables" | |
| 11:30-12 am | Pawel Hitczenko: "On complete compositions of integers" | |
| 12-12:30 pm | Véronique Maume: "Context algorithm and estimation of empirical trees" | |
| 12:30-2:30 pm | | |
| 2:30-3 pm | Cyril Banderier: "Average queue length and area below lattice paths" | |
| 3-3:30 pm | Mark Ward: "TBA" | |
| 3:30-4 pm | | |
| 4-4:30 pm | Frédérique Bassino and Alfredo Viola: "TBA" | |
| 4:30-5 pm | Daniel Panario: "TBA" | |
| 7 pm | | |
|
Contact
Luc Devroye
Ralph Neininger