COMP 690 Probabilistic Analysis of Algorithms (4 credits)

Note: This is the 20122013 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.

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 2012

Instructors: Luc P Devroye (Fall)

  • 3 hours