Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Richard Peng
2010 – today
- 2013
[c11]Hui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng: Runtime guarantees for regression problems. ITCS 2013: 269-282
[c10]Gary L. Miller, Richard Peng: Approximate Maximum Flow on Separable Undirected Graphs. SODA 2013: 1151-1170
[i12]- 2012
[j3]Ioannis Koutis, Gary L. Miller, Richard Peng: A fast solver for a class of linear systems. Commun. ACM 55(10): 99-107 (2012)
[j2]Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Mathematics 8(1-2): 161-185 (2012)
[c9]Richard Peng, Kanat Tangwongsan: Faster and simpler width-independent parallel algorithms for positive semidefinite programming. SPAA 2012: 101-108
[c8]Ioannis Koutis, Alex Levin, Richard Peng: Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. STACS 2012: 266-277
[c7]Jonathan A. Kelner, Gary L. Miller, Richard Peng: Faster approximate multicommodity flow using quadratically coupled flows. STOC 2012: 1-18
[i11]Richard Peng, Kanat Tangwongsan: Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming. CoRR abs/1201.5135 (2012)
[i10]Jonathan A. Kelner, Gary L. Miller, Richard Peng: Beyond Laplacians: Faster . CoRR abs/1202.3367 (2012)
[i9]Ioannis Koutis, Alex Levin, Richard Peng: Faster spectral sparsification and numerical algorithms for SDD matrices. CoRR abs/1209.5821 (2012)
[i8]Gary L. Miller, Richard Peng: Approximate Maximum Flow on Separable Undirected Graphs. CoRR abs/1210.5227 (2012)
[i7]- 2011
[j1]Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, Russell Schwartz: Approximation algorithms for speeding up dynamic programming and denoising aCGH data. ACM Journal of Experimental Algorithmics 16 (2011)
[c6]Ioannis Koutis, Gary L. Miller, Richard Peng: A Nearly-m log n Time Solver for SDD Linear Systems. FOCS 2011: 590-598
[c5]Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis: Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge Decomposition. SODA 2011: 1675-1682
[c4]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan: Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA 2011: 13-22
[c3]Guy E. Blelloch, Richard Peng, Kanat Tangwongsan: Linear-work greedy parallel approximate set cover and variants. SPAA 2011: 23-32
[i6]Ioannis Koutis, Gary L. Miller, Richard Peng: Solving SDD linear systems in time $\tilde{O}(m\log{n}\log(1/\epsilon))$. CoRR abs/1102.4842 (2011)
[i5]Aleksander Madry, Gary L. Miller, Richard Peng: Electrical Flow Algorithms for Total Variation Minimization. CoRR abs/1110.1358 (2011)
[i4]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan: Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. CoRR abs/1111.1750 (2011)- 2010
[c2]Ioannis Koutis, Gary L. Miller, Richard Peng: Approaching Optimality for Solving SDD Linear Systems. FOCS 2010: 235-244
[c1]Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. WAW 2010: 15-24
[i3]Ioannis Koutis, Gary L. Miller, Richard Peng: Approaching optimality for solving SDD systems. CoRR abs/1003.2958 (2010)
[i2]Gary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis: Approximate Dynamic Programming for Fast Denoising of aCGH Data. CoRR abs/1003.4942 (2010)
[i1]Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis: Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning. CoRR abs/1011.0468 (2010)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-14 22:05 CEST by the dblp team



