Algorithm Analysis Courses
IEEE via YouTube The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
IEEE via YouTube Faster Polytope Rounding, Sampling, and Volume Computation via a Sublinear Ball Walk
IEEE via YouTube Functions of Matrices - Lecture 5
Society for Industrial and Applied Mathematics via YouTube Big O Notations - Understanding Algorithm Efficiency
Derek Banas via YouTube Provable Submodular Function Minimization via Fujishige Wolfe Algorithm
Hausdorff Center for Mathematics via YouTube The Power of Randomization - Distributed Submodular Maximization on Massive Datasets
Hausdorff Center for Mathematics via YouTube Randomized Composable Core-Sets for Submodular Maximization
Hausdorff Center for Mathematics via YouTube The Silent Partners
Ekoparty Security Conference via YouTube CS50 2012 - Week 3 Continued: Search Algorithms and Sorting Techniques
Harvard University via YouTube