The 36th Hermann Weyl Lectures with Daniel Spielman

For the 36th Hermann Weyl Lectures, the School of Mathematics has invited Daniel Spielman from Yale Institute for Network Sciences to give a series of three lectures the week of November 3, 2014.


Daniel Alan Spielman received his B.A. in Mathematics and Computer Science from Yale in 1992, and his Ph.D in Applied Mathematics from M.I.T. in 1995. He spent a year as a NSF Mathematical Sciences Postdoc in the Computer Science Department at U.C. Berkeley, and then taught in the Applied Mathematics Department at M.I.T. until 2005. Since 2006, he has been a Professor at Yale University. He is presently the Henry Ford II Professor of Computer Science, Mathematics, and
Applied Mathematics.

He has received many awards, including the 1995 ACM Doctoral Dissertation Award, the 2002 IEEE Information Theory Paper Award, the 2008 Godel Prize, the 2009 Fulkerson Prize, the 2010 Nevanlinna Prize, the 2014 Polya Prize, an inaugural Simons Investigator Award, and a MacArthur Fellowship. He is a Fellow of the Association for Computing Machinery and a member of the Connecticut Academy of Science and Engineering. His main research interests include the design and analysis of algorithms, network science, machine learning, digital communications and scientific computing.

Schedule:

Monday, November 3, 2014 at 2 p.m.

Sparsification of Graphs and Matrices

Wednesday, November 5, 2014 at 2 p.m.

The Solution of the Kadison-Singer Problem

Thursday, November 6, 2014 at 2 p.m.

Ramanujan Graphs of Every Degree

The Hermann Weyl Lecture Series will be held in Simonyi Hall Seminar Room 101.

Date & Time

November 03, 2014 | 2:00pm – November 06, 2014 | 3:00pm

Categories