| Affiliations: |
Computer Science Dept. Theory Group.
Simons Investigator.
|
| Seminar: |
The Yale Combinatorics and Probability Seminar
|
| Current Research interests: |
Design and Analysis of Algorithms and Heuristics,
Machine Learning,
Smoothed Analysis, Combinatorial Scientific Computing.
|
| My Papers:, |
Sorted by Year
or
sorted by Subject
|
|
|
| My Thesis: |
Computationally Efficient
Error-Correcting Codes and Holographic Proofs
|
|
| Talks: |
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 Fronteirs Workshop.
|
| More Information on: |
My research, as described by
Gil Kalai,
and by
Michel Goemans and Jonanthan Kelner.
|
|
| |
Laplacian linear equations, sparsification
local graph clustering, low-stretch spanning trees, and so on.
|
| |
Smoothed analysis, at
the Smoothed Analysis Homepage,
including our analysis of the Simplex Method.
|
| |
Spectral Graph Theory and its Applications,
a tutorial I gave at FOCS 2007. |
|
|
| |
My work on Error Correcting Codes,
including Tornado Codes and
Linear-Time Codes |
|
| |
My work on Computational Complexity,
including
Quantum Computation and
Holographic Proofs |
|
| |
My work on
Fault-Tolerant Parallel Computation
|
|
|
| Course Homepages: |
Spectral Graph Theory (Fall 2012) |
| |
CPSC 365: Design and Analysis of Algorithms (Spring 2012) |
|
AMTH/CPSC 462/562: Graphs and Networks (Fall 2010) |
|
|
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) |
|
|
| Former Students: |
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)
|
|
| Present Students: |
Rasmus Kyng, Ekaterina Orekhova, Anup Rao, Huan Wang.
|
|
| Bio, CV, etc. |
Short Bio,
CV in PDF,
a picture of me,
a more recent picture. |
| Professional Activities: |
Program Chair of FOCS 2009 |
| Editorial Board of
SIAM Journal on Discrete Mathematics |
| Editorial Board of
Theory of Computing |
|
|
| Useful links: |
For
combinatorial scientific computing,
theory of computation,
coding theory,
software.
|
