IIT Madras · Computer Science

Algorithms for Big Data

Prof. John Augustine · 48 free video lectures

48 video lectures. Topics: Lesson 1 - Basic definitions; Lesson 2 - Conditional probability; Lesson 3 - Example problems; Lesson 4 - Karger's mincut algorithm; Lesson 5 - Analysis of Karger's mincut algorithm; Lesson 6 - Random variables; Lesson 7 - Randomized quicksort; Problem solving video - The…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lesson 1 - Basic definitions
  2. Lesson 2 - Conditional probability
  3. Lesson 3 - Example problems
  4. Lesson 4 - Karger's mincut algorithm
  5. Lesson 5 - Analysis of Karger's mincut algorithm
  6. Lesson 6 - Random variables
  7. Lesson 7 - Randomized quicksort
  8. Problem solving video - The rich get richer
  9. Problem solving video - Monty Hall problem
  10. Lesson 1 - Bernoulli, Binomial, and Geometric distributions
  11. Lesson 2 - Tail Bounds
  12. Lesson 3 - Application of Chernoff bound
  13. Lesson 4 - Application of Chebyshev's inequality
  14. Lesson 1 - Intro to Big Data Algorithms
  15. Lesson 2 - SAT Problem
  16. Lesson 3 - Classification of States
  17. Lesson 4 - Stationary Distribution of a Markov Chain
  18. Lesson 5 - Celebrities Case Study
  19. Lesson 6 - Random Walks on Undirected Graphs
  20. Lesson 7 - Intro to Streaming, Morris Algorithm
  21. Lesson 8 - Reservoir Sampling
  22. Lesson 9 - Approximate Median
  23. Lesson 1 : Overview
  24. Lesson 2 : Balls, bins, hashing
  25. Lesson 3 : Chain hashing, SUHA, Power of Two choices
  26. Lesson 4 : Bloom filter
  27. Lesson 5 : Pairwise independence
  28. Lesson 6 : Estimating expectation of continuous function
  29. Lesson 1 - Universal hash functions
  30. Lesson 2 - Perfect hashing
  31. Lesson 3 - Count-min filter for heavy hitters in data streams
  32. Problem solving video - Doubly Stochastic Transition Matrix
  33. Problem solving video - Random Walks on Linear Structures
  34. Problem solving video - Lollipop Graph
  35. Problem solving video - Cat And Mouse
  36. Lesson 1 - Estimating frequency moments
  37. Lesson 2 - Property testing framework
  38. Lesson 3 - Testing Connectivity
  39. Lesson 4 - Enforce & Test Introduction
  40. Lesson 5 - Testing if a graph is a biclique
  41. Lesson 6 - Testing bipartiteness
  42. Lesson 1 - Property testing and random walk algorithms
  43. Lesson 2 - Testing if a graph is bipartite (using random walks)
  44. Lesson 3 - Graph streaming algorithms: Introduction
  45. Lesson 4 - Graph streaming algorithms: Matching
  46. Lesson 5 - Graph streaming algorithms: Graph sparsification
  47. Lesson 1 - MapReduce
  48. Lesson 2 - K-Machine Model (aka Pregel Model)

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Madras.

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