Skip to content. Skip to navigation
McGill Home SOCS Home
Personal tools
You are here: Home → Academic → Courses → Course Profile

COMP- 690: PROBABILISTIC ANALYSIS OF ALGORITHMS

Course Summary

Probabilistic analysis of algorithms and data structures under random input. Expected behavior 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. This is a challenging course meant for those really willing to learn.

McGill Course Description (Click Here)


Fall 2012
McGill Course Calendar Details
Course Homepage

Instructor:

TA: