| Affiliations: |
Computer Science Dept. Theory Group,
Cowles Foundation
|
| Current Research interests: |
Design and Analysis of Algorithms and Heuristics,
Smoothed Analysis, Combinatorial Scientific Computing,
Error-Correcting Codes |
| Research: |
Research Overview, in
Postscript or
PDF (outdated) |
| |
My Papers, sorted by Year
or
sorted by Subject (slightly outdated)
|
|
|
| My Thesis: |
Computationally Efficient
Error-Correcting Codes and Holographic Proofs
|
|
| More Information on: |
Spectral Graph Theory and its Applications,
a tutorial I gave at FOCS 2007. |
|
| |
Smoothed analysis, at
the Smoothed Analysis Homepage,
including our analysis of the Simplex Method.
|
|
| |
Other work on Algorithms,
including Graph Partitioning,
and Solving linear systems |
|
| |
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
|
|
| Seminar: |
Discrete Math and Theoretical Computer Science Seminar |
|
|
| Course Homepages: |
|
CPSC 365: Design and Analysis of Algorithms (Spring 2008) |
|
AMTH/CPSC 462/562: Graphs and Networks (Fall 2007) |
|
Spectral Graph Theory and its Applications |
|
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)
|
|
| Present Students: |
Samuel Daitch, Nikhil Srivastava
|
|
| Bio, CV, etc. |
Short Bio,
CV in Postscript,
CV in PDF,
Picture. |
| Professional Activities: |
Editorial Board of
Theory of Computing |
|
|
| Useful links: |
For
combinatorial scientific computing,
theory of computation,
coding theory,
software.
|
