My primary appointments at Yale are as the Henry Ford II professor of
Computer Science
and Statistics and Data
Science at
Yale University.
I have secondary appointments in Mathematics, and Applied Mathematics. I am a Simons Investigator and a MacArthur Fellow, and the co-Director of the Yale Institute for Network Science (YINS). Until the end of Spring 2017, I am the Director of Undergraduate Studies for the major in Applied Mathematics. As of Fall 2017, I will be co-DUS of the major in Statistics and Data Science. I co-organize the YINS Seminar and the Combinatorics and Probability Seminar. I am a member of the ACM, AMS, IEEE, SIAM, the National Academy of Sciences, and the CT Academy of Science and Engineering. |

- My papers, sorted by Year or sorted by Subject .
- My CV, a short bio, and photographs of me.
- Descriptions of my research
- Slides from and videos of my talks
- My courses
- Software by my group
- My students
- Professional activities (a few things I've organized)
- Laplacian linear equations, sparsification local graph clustering, low-stretch spanning trees, and so on.
- Internships and opportunities to work with me.
- Contact information

- 'Outsiders' Crack 50-Year-Old Math Problem, an article by Erica Klerreich from Quanta Magazine about the solution of the Kadison-Singer Problem.
- Network Solutions, an article by Erica Klarreich for the Simons Foundation about work in which my community is involved.
- Gil Kalai's laudation for my Nevanlinnna Prize.
- An article about by research by Michel Goemans and Jonathan Kelner.
- An article for SIAM News by Dana Mackenzie about my research on the Kadison-Singer Problem.
- The citation for the 2008 Godel Prize.
- The citation for the 2015 Godel Prize.
- The article "Smoothed Move" by Barry Cipra in What's Happening in the Mathematical Sciences, Volume 6, an article about Smoothed Analysis.
- The article "The Kadison-Singer Problem: A Fine Balance" by Dana Mackenzie in What's Happening in the Mathematical Sciences, Volume 10.

- Spectral Graph Theory and its Applications, a tutorial I gave at FOCS 2007.
- My talk from ICM 2010: slides, video, paper, opening ceremony.
- The Blyth Memorial Lectures at Toronto on Laplacian Matrices of Graphs: Applications (9/28/11), Computations (9/29/11), and Approximations (9/30/11).
- Spectral and Electrical Graph Theory (given at the Caesarea Rothschild Institute, Haifa, May 17, 2011.
- Spectral Sparsification of Graphs (as given at the Weizmann Institute on May 15, 2011). A video of me giving a related talk at MSR NE
- FOCS 2010
- EPFL Sparsification Talk, from the June 2012 Algorithmic Frontiers Workshop.
- The Erdos Lectures at Hebrew University (2014). 1. Kadison-Singer, 2. Sparsification of Graphs and Matrices, 3. Ramanujan Graphs of Every Degree.
- Slides from my Hamilton Day Lecture, in Powerpoint (recommended) or PDF.
- Slides from the 2016 Josiah Willard Gibbs Lecture at the Joint Mathematics Meeting, in Powerpoint (recommended) or PDF.
- Slides from my plenary talk at ICML 2016 in Powerpoint (recommended) or PDF.
- Slides from my plenary talk at ISIT 2016 in Powerpoint (recommended) or PDF.

- CPSC 366: Intensive Algorithms (Spring 2018)
- CPSC 365: Design and Analysis of Algorithms (Spring 2017)
- AMTH/CPSC/STAT 262: Computational Tools for Data Science (Fall 2016)
- Spectral Graph Theory (Fall 2015), (Fall 2012), (Fall 2009).
- AMTH/CPSC 462/562: Graphs and Networks (Fall 2013), (Fall 2010), (Fall 2007), (Fall 2006).
- Spectral Graph Theory and its Applications (Fall 2004)
- Error-Correcting Codes Laboratory (MIT)
- Eigenvalues of Graphs with Applications (MIT)
- The Behavior of Algorithms (MIT)
- Advanced Complexity Theory (MIT)
- Applied Extremal Combinatorics (MIT)

- Laplacians.jl a Julia package for solving problems related to Laplacian matrices and for generating interesting problem instances. It contains good code for solving Laplacian linear equations, computing low-stretch spanning trees, and generating interesting graphs.
- YINSlex The code used in the experiments from the paper Algorithms for Lipschitz Learning on Graphs
- Isotonic An interior point method for isotonic regression. Based on the paper Fast, Provable Algorithms for Isotonic Regression in all l_p-norms. Laplacians.jl contains a variant of this code.

- Adam Klivans (Ph.D. 2002),
- Louay Bazzi (Ph.D. 2003)
- Mohammad Mahdian (Ph.D. 2004),
- Arvind Sankar (Ph.D. 2004)
- Jon Kelner (Ph.D. 2006),
- Amit Desphande (Ph.D. 2007)
- Samuel Daitch, (Ph.D. 2010),
- Nikhil Srivastava (Ph.D. 2010)
- Huan Wang (Ph.D. 2013)
- Anup Rao (Ph.D. 2015).
- Rasmus Kyng (Current).
- Chen Shao (Current)
- Chris Harshaw (Current)

- MSRI Hot Topic Workshop: Kadison-Singer, Interlacing Polynomials, and Beyond
- Simons Institute Workshop: Fast Algorithms via Spectral Methods
- Program Chair of FOCS 2009

- Photographs of me may be found at my MacArthur Foundation page,
- here, here, and here.

This is what I use to schedule meetings at times of high demand. If it does not list any times, I suggest contacting me by email.

Address:

PO Box 208263

17 Hillhouse Ave, Room 340

New Haven, CT 06520-8263

phone: (203) 436-1264

fax: (203) 432-0593

Email: *lastname at cs dot yale dot edu *