Daniel A. Spielman

GPTKB entity

Statements (45)
Predicate Object
gptkbp:instance_of gptkb:Computer_Scientist
gptkbp:affiliation gptkb:Yale_University
gptkbp:awards gptkb:Godel_Prize
gptkb:Mac_Arthur_Fellowship
gptkbp:birth_date 1970-01-01
gptkbp:contribution promoted diversity in STEM fields
contributed to the field of approximation algorithms
published numerous papers in theoretical computer science
explored connections between computer science and physics
explored the implications of quantum computing on algorithms
advocated for interdisciplinary research in computer science
contributed to the theory of expander graphs
developed techniques for solving linear systems
developed the Spielman– Teng algorithm
investigated the role of randomness in computation
participated in various academic conferences
served on editorial boards of major journals
engaged in public outreach for science and mathematics education
worked on the theory of low-stretch spanning trees
developed educational resources for teaching algorithms
collaborated with researchers across multiple disciplines
contributed to the understanding of the hardness of approximation problems
research on the complexity of matrix multiplication
studied the limits of computation in various models.
studied the interplay between geometry and computation
analyzed the performance of algorithms on real-world data
mentored many graduate students in computer science
gptkbp:education gptkb:Harvard_University
gptkb:University_of_California,_Berkeley
gptkbp:field gptkb:computer_science
gptkb:Mathematics
theoretical computer science
https://www.w3.org/2000/01/rdf-schema#label Daniel A. Spielman
gptkbp:influenced_by gptkb:Robert_Tarjan
gptkb:Alfred_Aho
gptkb:Michael_Sipser
gptkbp:known_for spectral graph theory
graph algorithms
gptkbp:research_focus gptkb:machine_learning
data science
randomized algorithms
gptkbp:title gptkb:1996
Spectral Graph Theory
gptkbp:bfsParent gptkb:Michael_Sipser
gptkbp:bfsLayer 5