Richard Peng

Richard Peng is an Associate Professor in the Computer Science Department at Carnegie Mellon University, part of the School of Computer Science. He specializes in designing efficient algorithms for fundamental computational problems, particularly in graph algorithms, dynamic algorithms, and linear algebraic computations. Prior to joining CMU in 2023, he earned his BMath from the University of Waterloo, a PhD from CMU under Gary L. Miller, and completed a postdoc at MIT's Applied Math department.

His research focuses on advancing algorithmic efficiency, including work on sparse linear systems, graph convolutions, and flow optimization. He advises PhD students Hoai-An Nguyen, Alicia Stepin, and Junzhao Yang. His teaching includes courses such as 15495 and 15151, reflecting his engagement in both research and education.

Peng’s articles span topics like approximate spanning tree counting, dynamic graph algorithms, and Laplacian solvers, emphasizing practical scalability and theoretical guarantees. His contributions bridge theoretical computer science with applied challenges in network analysis and numerical computation.