COMP 690. Probabilistic Analysis of Algorithms.
Credits: 4
Offered by: Computer Science (Graduate Studies)
This course is not offered this catalogue year.
Description
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.
- 3 hours