Articles with public access mandates - Daniel SpielmanLearn more
Available somewhere: 7
An efficient parallel solver for SDD linear systems
R Peng, DA Spielman
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
Mandates: John D. and Catherine T. MacArthur Foundation
Sparsified cholesky and multigrid solvers for connection laplacians
R Kyng, YT Lee, R Peng, S Sachdeva, DA Spielman
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Mandates: US National Science Foundation
A Cheeger inequality for the graph connection Laplacian
AS Bandeira, A Singer, DA Spielman
SIAM Journal on Matrix Analysis and Applications 34 (4), 1611-1630, 2013
Mandates: US National Institutes of Health
Interlacing families IV: Bipartite Ramanujan graphs of all sizes
AW Marcus, DA Spielman, N Srivastava
SIAM Journal on computing 47 (6), 2488-2509, 2018
Mandates: US National Science Foundation, John D. and Catherine T. MacArthur Foundation
Balancing covariates in randomized experiments with the gram–schmidt walk design
C Harshaw, F Sävje, DA Spielman, P Zhang
Journal of the American Statistical Association, 1-13, 2024
Mandates: US National Science Foundation, US Department of Defense
Finite free convolutions of polynomials
AW Marcus, DA Spielman, N Srivastava
Probability Theory and Related Fields 182 (3), 807-848, 2022
Mandates: US National Science Foundation, John D. and Catherine T. MacArthur Foundation
Interlacing families III: Sharper restricted invertibility estimates
AW Marcus, DA Spielman, N Srivastava
Israel Journal of Mathematics, 1-28, 2022
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program