COMP 690 Probabilistic Analysis of Algorithms (4 credits)

Offered by: Computer Science (Faculty of Science)

Administered by: Graduate Studies


Computer Science (Sci) : Probabilistic analysis of algorithms and data structures under random input. Expected behaviour of search trees, tries, heaps, bucket structures and multidimensional data structures. Random sampling, divide-and-conquer, grid methods. Applications in computational geometry and in game tree searching. Combinatorial search problems. Algorithms on random graphs.

Terms: Fall 2016

Instructors: Luc P Devroye (Fall)

  • 3 hours