This page has not been updated since August 2013.

Carnegie Mellon University

7713 Hillman Center

email address

- Manoj Gupta, and Richard Peng. Fully Dynamic (1+ε)-Approximate Matchings. To appear, FOCS 2013. (arXiv)
- Mu Li, Gary L. Miller, and Richard Peng. Iterative Row Sampling. To appear, FOCS 2013. (arXiv)
- Gary L. Miller, Richard Peng, and Shen Chen Xu. Parallel Graph Decompositions Using Random Shifts. In SPAA 2013. (arXiv)
- Hui Han Chin, Aleksander Mądry, Gary L. Miller, and Richard Peng. Runtime Guarantees for Regression Problems. In ITCS 2013. (arXiv)
- Gary L. Miller, and Richard Peng. Approximate Maximum Flow on Separable Undirected Graphs. In SODA 2013. (arXiv)
- Richard Peng, and Kanat Tangwongsan. Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming. In SPAA 2012. (arXiv)
- Jonathan A. Kelner, Gary L. Miller, and Richard Peng. Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows. In STOC 2012. (arXiv)
- Ioannis Koutis, Alex Levin, and Richard Peng. Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. In STACS 2012. (conf) arXiv version: Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices.
- Ioannis Koutis, Gary L. Miller, and Richard Peng. A Nearly mlogn Time Solver for SDD Linear Systems. In FOCS 2011. (arXiv)
- Guy E. Blelloch, Richard Peng, and Kanat Tangwongsan. Linear-Work Greedy Parallel Approximate Set Cover and Variants. In SPAA 2011.
- Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, and Kanat Tangwongsan. Near linear Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. In SPAA 2011. (arXiv)
- Gary L. Miller, Richard Peng, Russell Schwartz and Charalampos E. Tsourakakis. Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge decomposition. In SODA 2011. (arXiv)
- Mihail N. Kolountzakis, Gary L. Miller, Richard Peng and Charalampos E. Tsourakakis. Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning. In WAW 2010. (arXiv)
- Ioannis Koutis, Gary L. Miller, and Richard Peng. Approaching Optimality for Solving SDD Systems. In FOCS 2010. (arXiv)

- In Fall 2012 I'm running a 'reading course' on Algorithmic Graph Theory
- I'm regularly involved with 15-295 Competition Programming and Problem Solving
- In Fall 2011 I helped for 15-859N: Spectral Graph Theory and Numerical Linear Algebra
- In Spring 2011 I was one of the TAs for 15-451 Algorithms
- In Spring 2010 I was one of the TAs for 15-750 Graduate Algorithms