Randomised Algorithms
Randomised Algorithms
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, 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.
Duration: Not defined
Level: Graduate
Certification: No
Cost: Free
Language: English
Type: Self-Paced
Please note: these courses are provided by external sources, links are not actively managed or regularly updated, content might be moved or unavailable.