FRIDAY

  • 10:30 - 1:00 CHAIR: P. Jacquet
    • B. Chauvin
      "A Martingale Method for the Profile of Binary Search Trees"
    • J. Fill
      "An In-depth Probabilistic Analysis of Quicksort"
    • M. Kubale
      "Can Small Graphs be Colored Optimally"
    • W. Szpankowski
      "Height Distribution in Digital Trees"
  • 2:00-9:00 DISCUSSION and SURPRISE