2016
Sparsified Cholesky and multigrid solvers for connection laplacians
Kyng R, Lee Y, Peng R, Sachdeva S, Spielman D. Sparsified Cholesky and multigrid solvers for connection laplacians. 2016, 842-850. DOI: 10.1145/2897518.2897640.Peer-Reviewed Original ResearchSystem of equationsConnection LaplacianNonzero matrix entriesApproximate inverseLinear time algorithmMultigrid algorithmMultigrid solverLinear equationsLaplacian matrixGaussian eliminationGraph LaplacianMatrix entriesLU factorizationNonzero entriesStrong approximationOriginal matrixLinear numberEquationsLaplacianLinear timeTime algorithmNew algorithmAlgorithmCholeskyFactorization
2011
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Christiano P, Kelner J, Madry A, Spielman D, Teng S. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. 2011, 273-282. DOI: 10.1145/1993636.1993674.Peer-Reviewed Original Research
1999
Constructing Error-Correcting Codes from Expander Graphs
Spielman D. Constructing Error-Correcting Codes from Expander Graphs. The IMA Volumes In Mathematics And Its Applications 1999, 109: 591-600. DOI: 10.1007/978-1-4612-1544-8_25.Peer-Reviewed Original Research
1997
The complexity of error-correcting codes
Spielman D. The complexity of error-correcting codes. Lecture Notes In Computer Science 1997, 1279: 67-84. DOI: 10.1007/bfb0036172.Peer-Reviewed Original Research