Search Results (1)

View
Selected filters:
  • Game-Theoretic Techniques
Randomized Algorithms, Fall 2002
Conditions of Use:
Remix and Share
Rating

Studies how randomization can be used to make algorithms simpler and more ...

Studies how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Models of randomized computation. Data structures: hash tables, and skip lists. Graph algorithms: minimum spanning trees, shortest paths, and minimum cuts. Geometric algorithms: convex hulls, linear programming in fixed or arbitrary dimension. Approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms.

Subject:
Computer Science
Geometry
Material Type:
Full Course
Textbooks
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Karger, David