Linear-size ℓ₁ Sparsifiers
Proof of the existence of linear-size ℓ₁ sparsifiers for any matrix, showing that zonotopes can be approximated by those generated by a significantly smaller number of vectors.
Microsoft Research
Distinguished colloquia in distributed systems, formal verification, programming languages, and theoretical physics.
University Courses
0
Standalone archive
Recorded Lectures
4
4 standalone talks
Archive Runtime
4h
Unabridged recordings
Faculty & Speakers
3
Avg rigor 94/100
Discipline:
Talks & colloquia from Microsoft Research
4Self-contained research seminars, public lectures, and invited colloquia.
Escape from the Ivory Tower: The Haskell Journey
Explains how call-by-need lazy evaluation forced functional programming researchers to invent monadic effect systems, type classes, and purity-guided compiler transformations.
Leslie Lamport: Thinking Above the Code
Turing Award winner Leslie Lamport argues that writing code before writing a mathematical state-machine specification is like pouring concrete before drawing an architectural blueprint.
Quantum Computing for Computer Scientists
This seminar rigorously introduces quantum computing from a computer science perspective, detailing quantum bits, superposition, and quantum logic gates through linear algebra. It demonstrates the Deutsch-Jozsa algorithm to illustrate quantum advantage and explores quantum entanglement.
Faculty & visiting speakers at Microsoft Research
3Professors, researchers, and invited lecturers recorded at Microsoft Research.
All recorded lectures from Microsoft Research
4Browse, filter, and sort every lecture from Microsoft Research.
Showing 4 of 4 lectures
Lecturej/k navigate · c chapters · s save · x watched
Scholar · University
Chapters · Duration
45:15
1:04:15
59:50
1:28:22