ProfessorsProfessors of Yale UniversityDaniel Spielman

Daniel Spielman

Yale University

H-index: 57

North America-United States

About Daniel Spielman

Daniel Spielman, With an exceptional h-index of 57 and a recent h-index of 37 (since 2020), a distinguished researcher at Yale University, specializes in the field of Theoretical Computer Science.

His recent articles reflect a diverse array of research interests and contributions to the field:

Balancing covariates in randomized experiments with the gram–schmidt walk design

Robust and practical solution of laplacian equations by approximate elimination

Hardness Results for Weaver's Discrepancy Problem

Finite free convolutions of polynomials

Interlacing families III: Sharper restricted invertibility estimates

Daniel Spielman Information

University	Yale University
Position	Professor of Computer Science
Citations(all)	21227
Citations(since 2020)	6352
Cited By	17927
hIndex(all)	57
hIndex(since 2020)	37
i10Index(all)	89
i10Index(since 2020)	58
Email	Access Email
University Profile Page	Yale University
Google Scholar	View Google Scholar Profile

Daniel Spielman Skills & Research Interests

Theoretical Computer Science

Top articles of Daniel Spielman

Title	Journal	Author(s)	Publication Date
Balancing covariates in randomized experiments with the gram–schmidt walk design	Journal of the American Statistical Association	Christopher Harshaw Fredrik Sävje Daniel A Spielman Peng Zhang	2024/1/9
Robust and practical solution of laplacian equations by approximate elimination	arXiv preprint arXiv:2303.00709	Yuan Gao Rasmus Kyng Daniel A Spielman	2023/3/1
Hardness Results for Weaver's Discrepancy Problem	arXiv preprint arXiv:2205.01482	Daniel A Spielman Peng Zhang	2022/5/3
Finite free convolutions of polynomials	Probability Theory and Related Fields	Adam W Marcus Daniel A Spielman Nikhil Srivastava	2022/4
Interlacing families III: Sharper restricted invertibility estimates	Israel Journal of Mathematics	Adam W Marcus Daniel A Spielman Nikhil Srivastava	2022/4/1