Seminar - Dr. Richard Peng, MIT

Thursday, January 29 at 3:30 pm to 4:20 pm
Seamans Center, 3505
103 South Capitol Street, Iowa City, Iowa

Title:  Algorithms Design Using Spectral Graph Theory Abstract:  Spectral graph theory is the interplay between linear algebra and combinatorial graphs. Laplace’s equation and its discrete form, the Laplacian matrix, are becoming increasingly popular in optimization, image processing, and machine learning. This talk will discuss some key ideas from this paradigm of designing efficient algorithms. They build upon tools from numerical analysis, graph algorithms, and random matrix theory. Bio:  Richard Peng is an Instructor in Applied Mathematics at MIT. He received his Ph.D. in computer science from Carnegie Mellon University in 2013 and his bachelor’s degree in computer science and combinatorics &optimization from the University of Waterloo in 2009. > > Richard’s main research is in the design and application of efficient algorithms. He is interested in the connection between combinatorial and discrete optimization algorithms, and ways of combining the advantages of both approaches. His other research interests include data structures, scientific computing, randomized algorithms, and parallel computing. He was a Microsoft Research PhD Fellow and a winner of the CMU SCS dissertation award

Contact Info: Carol Ives,, (319) 335-5710