Title: Introduction to random binary search trees

Speaker:  Luc Devroye
McGill University

Date: Thursday, August 21, 2008
Time 3:00-4:30PM
Venue: Room 3501, HKUST

Abstract:
I will introduce the main tools used in
the probabilistic analysis of random binary
search trees without assuming a lot of
probability theoretical background.
We will look at the depth of a typical node,
the height, and cover in passing quicksort
and "treaps".

This is a blackboard-and-chalk presentation,
but I realize that at HKUST I will have to settle
for whiteboard-and-chemical-pens.