Categories
1 results found in 9 ms.
Page 1 of 1
More OCW like this 

Published by: Massachusetts Institute of Technology  Language: English
Published by: Massachusetts Institute of Technology  Language: English
Share in:
This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimu
Author(s):
Tag(s):
 electrical engineering and computer science
 randomized algorithms
 algorithms
 efficient in time and space
 randomization
 computational problems
 data structures
 graph algorithms
 optimization
 geometry
 markov chains
 sampling
 estimation
 geometric algorithms
 parallel and distributed algorithms
 parallel and ditributed algorithm
 parallel and distributed algorithm
 random sampli
1 results found.
Page 1 of 1