Scientific American
Graduate student John Urschel appears on the Scientific American podcast My Favorite Theorem, where he shares his love of a theorem for graph theory developed by Daniel Spielman. Urschel points out that Spielman is “one of the first people to give provable guarantees for algorithms that can solve a Laplacian system of equations in near linear time.”