Yale University has named Daniel Spielman, TPS class of 1984, as Sterling Professor of Computer Science, the highest honor bestowed on Yale faculty.
Danny (as we called him) focuses his research on the design and analysis of algorithms, network science, machine learning, digital communications, and scientific computing. His work helped revolutionize the field of error-correcting codes, making communication faster and more reliable. In 2013, he and two collaborators solved the Kadison-Singer conjecture, a problem that had gone unsolved by mathematicians for more than 50 years.
A 1992 summa cum laude graduate of Yale, where he earned exceptional distinction in computer science and received the Beckwith Prize in mathematics, Dan received his Ph.D. at the Massachusetts Institute of Technology. After teaching at MIT for several years, he joined the Yale faculty in 2006 as professor of applied mathematics and computer science.
In 2013, Dan received a MacArthur Fellowship, popularly known as the “genius” grant. He was also awarded the 2010 Rolf Nevanlinna Prize from the International Mathematical Union, the 2009 Fulkerson Prize, and, on two occasions, the Gödel Prize for outstanding papers in the area of theoretical computer science.
Dan is a member of the National Academy of Sciences. We hope we can get him back to the halls of TPS to talk about his work - and how it all began with teacher Carter Fussell and Cuisenaire rods!
Read YaleNews about Dan's "complicated work."