每日探花

COMP 690 Probabilistic Analysis of Algorithms (4 credits)

Offered by: Informatique (Facult茅 des sciences)

Administered by: 脡tudes sup茅rieures et recherch

Vue d'ensemble

Informatique (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: Automne 2009

Instructors: Devroye, Luc P (Fall)

  • 3 hours
Back to top