CSE290A, Spring 2020: Lec 16, the Count-Min sketch, and the AMS algorithm for frequency momentsMay 24, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: Lec 15, improved distinct elements and introduction to heavy hittersMay 20, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: Lec 14, counting distinct elements in the streaming modelMay 16, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: Lec 12, Introduction to distribution testingMay 8, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: Lec 11, the Poisson approximating and PoissonlzationMay 6, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: Lec 9, proof of the Chernoff upper tail, discussion of the tail boundApr 30, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: The Johnson-Lindenstrauss lemmaApr 25, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: Estimating the average degree of a graphApr 22, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: Lec 7, Walker's alias methodApr 22, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Randomized Algorithms: Lec6, Cohen-Lewis matrix multiplicationApr 17, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: Lec 5, improved Karp-Luby-MadrasApr 15, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A Spring 2020: Lec 4, Karp-Luby importance samplingApr 10, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020: Lec 2, the Hoeffing boundApr 3, 2020 · C. Seshadhri▶Play+Watch later+Read later
CSE290A, Spring 2020, Lec1: Quicksort and Karger's mincutApr 1, 2020 · C. Seshadhri▶Play+Watch later+Read later
