IIT Guwahati · Computer Science
Randomized Algorithms
Prof. Benny George K · 41 free video lectures
41 video lectures. Topics: Introduction to Randomized Algorithms; Randomized Mincut Algorithm; Randomized Find; Probability Review; Expectation of Random Variables; Conditional Probability and Conditional Expectation2; Birthday Paradox; Markov and Chebychev's Inequalities; Median Algorithm…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Introduction to Randomized Algorithms
- Randomized Mincut Algorithm
- Randomized Find
- Probability Review
- Expectation of Random Variables
- Conditional Probability and Conditional Expectation2
- Birthday Paradox
- Markov and Chebychev's Inequalities
- Median Algorithm
- Chernoff Bound
- Permutation Routing on a Hypercube
- Permutation Routing on a Hypercube(Analysis)
- Introduction to Probabilistic Method
- More Examples on Probabilistic Method
- Lovasz Local Lemma
- Introduction to Markov Chains
- 2-SAT and Markov Chains
- 3-SAT and Markov Chains
- Electrical Networks
- Cover Time
- Rapid Mixing
- Introduction to Computational Complexity
- Pratt's Certificate
- Primality Testing
- Miller Rabin Algorithm
- All pair shortest path-I
- All pair shortest path-II
- Randomized MST
- Introduction to approximate counting
- DNF counting
- Perfect Matching-I
- Perfect Matching-II
- Perfect Matching-III
- Treaps
- Hashing
- Probabilistically checkable proofs - I
- Probabilistically checkable proofs - II
- Probabilistically checkable proofs - III
- LFKN Protocol
- summary
- Live Session 12-03-2020
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Guwahati.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights