**Tight analyses for non-smooth stochastic gradient descent**, in UW Theory Seminar, Seattle, WA. PPTX.**Partitioning Sets to Decrease the Diameter (Borsuk's Conjecture)**, in UBC Math Circles. PPTX.

**Computing the Independence Polynomial: from the Tree Threshold down to the Roots**, at SODA 2018, New Orleans, LA. PDF.

**Computing the Independence Polynomial: from the Tree Threshold down to the Roots**, colloquium at the UBC math department.

**An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles**, in the UBC Probability Seminar.**Discrepancy theory and the Lovasz Local Lemma**, in the UBC Discrete Math Seminar.**An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles**, at Microsoft Research, Redmond, WA. PPTX PDF**An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles**, at University of Washington, Seattle, WA.**An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles**, at the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, CA. PPTX PDF**An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles**, at EPFL, Lausanne, Switzerland.**Fast Algorithms**. Distinguished Speaker at the Sixth Cargese Workshop on Combinatorial Optimization.

Lecture 1: Low-stretch trees. Lecture 2: Matrix Chernoff bounds. Lecture 3: Sparsifiers.**Approximating Hit Rate Curves using Streaming Algorithms**, at the 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). PPTX**An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles**, at the International Symposium on Mathematical Programming, Pittsburgh, PA.**An Algorithmic Proof of the Lopsided Lovasz Local Lemma**, at the Bellairs Workshop on Discrepancy and Modern Rounding, Barbados.**A Survey of Discrepancy Theory**, at MSRI Workshop: Kadison-Singer, Interlacing Polynomials, and Beyond, Berkeley, CA.**Matrix Concentration and Matroid Bases**, at AMS-MAA Joint Mathematics Meetings, San Antonio, TX. PPTX

**Counter Stacks: Storage Workload Analysis via Streaming Algorithms**, at UBC Computer Science Faculty Lecture Series. PPTX**Counter Stacks: Storage Workload Analysis via Streaming Algorithms**, at Microsoft Research, Redmond, WA.**Approximating Hit Rate Curves using Streaming Algorithms**, at the Shonan workshop on Algorithms for Large Scale Graphs, Japan.**Spectrally Thin Trees**, in Theory Seminar, University of Chicago, Chicago, IL.

**Sparse Approximations**, in Functional Analysis Seminar, University of Alberta. PPTX, PDF.**Spectrally Thin Trees**, at Workshop on Flexible Network Design, Fields Institute, Toronto, ON. PPTX, PDF.**Spectrally Thin Trees**, at University of Warsaw, Institute of Informatics.**Spectrally Thin Trees**, at the Pacific Northwest Theory Days, Victoria, BC.**Spectrally Thin Trees**, at the Bellairs Workshop on Approximation Algorithms, Barbados.**Spectrally Thin Trees**, at the Microsoft Research Theory Group, Redmond, WA.

**Matrix Concentration**, at the Workshop on Randomized Numerical Linear Algebra. PPTX, PDF.**Graph Sparsifiers**, at the SFU Discrete Math Seminar, Vancouver, BC.**Submodular Functions: Learnability, Structure and Optimization**, at the UBC Operations and Logistics Seminar. PPTX.**Graph Sparsifiers**, at the International Symposium on Mathematical Programming, Berlin, Germany. PPTX.

**Solving Laplacian Systems: Some Contributions from Theoretical Computer Science**, at the UBC Scientific Computing and Applied & Industrial Mathematics Seminar. PPTX, PDF.**Graph Sparsifiers: A Survey**, at the University of Washington, Seattle, WA. PPTX, PDF.**Graph Sparsifiers: A Survey**, at Georgia Institute of Technology, Atlanta, GA.**Graph Sparsifiers: A Survey**, at Carnegie Mellon University, Pittsburgh, PA.**Graph Sparsifiers: A Survey**, in the UBC CS Theory Seminar.**Graph Sparsifiers by Edge-Connectivity and Random Spanning Trees**, at Google Research, New York, NY. PPTX.**Graph Sparsifiers by Edge-Connectivity and Random Spanning Trees**, at the Institute for Advanced Study, Princeton, NJ.**Graph Sparsifiers by Edge-Connectivity and Random Spanning Trees**, at Bellairs Workshop on Approximation Algorithms, Barbados.**Graph Sparsifiers by Edge-Connectivity and Random Spanning Trees**, at the University of Michigan, Ann Arbor, MI.

**Graph Sparsifiers by Edge-Connectivity and Random Spanning Trees**, at the Institute for Pure and Applied Mathematics, Los Angeles, CA.**Graph Sparsifiers**, in the University of Waterloo Tutte Seminar, Waterloo, ON.**Partitioning Sets to Decrease the Diameter (Borsuk's Conjecture)**, at University of Waterloo Combinatorics and Optimization Summer School, Waterloo, ON. PPTX.**Matroids from Lossless Expander Graphs**, at SIAM DM, Austin, TX. PPTX.**Learning Submodular Functions**, at Research Institute for Mathematical Sciences, Kyoto, Japan. PPTX.**Learning Submodular Functions**, at Bellairs Workshop on Approximation Algorithms, Barbados.**The Best Algorithms are Randomized Algorithms**, hosted by the University of Waterloo Computer Science Club, Waterloo, ON. PPTX.