|
|
|
|
|
|
|
|
 |
||||||||||||||||||||||||||||
 Main
Page
Graduate
Program Undergraduate
Program
Course Information Course
Web Pages
Our
Research Research
Areas Technical
Reports
Faculty Graduate
Students Research
and Technical Staff Administrative
Staff Alumni Degree
Recipients
Calendars Computing
Facilities CS
Talks Mailing List Yale
Computer Science FAQ Yale Workstation Support Computing
Lab AfterCollege
Job Resource Graduate
Writing Center
Contact
Us History Life in the Department Life About Town Directions
Faculty
Positions
City
of New Haven Yale
Applied Mathematics Yale
C2: Creative Consilience of
Computing and the Arts Yale
Faculty of Engineering Yale
GSAS Staff Directory Yale
University Home Page Google Search Yale Info Phonebook
Internal |
Daniel A. Spielman
|
|||||||||||||||||||||||||||
 |
Daniel Spielman's interests include the analysis of algorithms and heuristics, error-correcting codes, combinatorial scientific computing, spectral graph theory, and combinatorics.
Awards Daniel Spielman has received are:
1. The 2002 Information Theory Society Paper Award
2. Invitied speaker at the 2002 International Congress of
Mathematicians.
3. Semi-plenary speaker at the 2003 International Symposium on
Math Programming.
4. 1995 ACM Doctoral Dissertation Award
| Representative Publications |
|
 |
"Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time,'' Journal of the ACM, Vol 51 (3), pp. 385 - 463, 2004. With S.-H. Teng |
|
"Smoothed Analysis of Termination of Linear Programming Algorithms'', Mathematical Programming, Series B, Vol 97, pp. 375-404, 2003. With S.-H. Teng |
|
"Efficient Erasure Correcting Codes,'' IEEE Transactions on Information Theory, 47(2), pp. 569-584, Feb. 2001. With M. G. Luby, M. Mitzenmacher and M. A. Shokrollahi. |
|
|
"Improved Low-Density Parity-Check Codes Using Irregular Graphs,'' IEEE Transactions on Information Theory, 47(2), pp. 585-598, Feb. 2001. With M. G. Luby, M. Mitzenmacher and M. A. Shokrollahi. |
|
|
"Linear-Time Encodable and Decodable Error-Correcting Codes,'' IEEE Transactions on Information Theory, 42(6), pp. 1723-1731, Nov. 1996. |
|
|
"Expander Codes,'' IEEE Transactions on Information Theory, 42(6), pp. 1710-1722, Nov. 1996. With M. Sipser. |
 |
|