pith. sign in

Richard Peng

Identifiers

  • name variant Richard Peng 0.60 · backfill

Papers (46)

  1. Flows in Almost Linear Time via Adaptive Preconditioning cs.DS · 2019 · author #2
  2. Fully Dynamic Spectral Vertex Sparsifiers and Applications cs.DS · 2019 · author #4
  3. Higher-Order Accelerated Methods for Faster Non-Smooth Optimization math.OC · 2019 · author #2
  4. Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations cs.DS · 2018 · author #5
  5. Constant Arboricity Spectral Sparsifiers cs.DS · 2018 · author #4
  6. Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions cs.DS · 2018 · author #3
  7. Incomplete Nested Dissection cs.DS · 2018 · author #2
  8. Fully Dynamic Effective Resistances cs.DS · 2018 · author #4
  9. Current Flow Group Closeness Centrality for Complex Networks cs.DS · 2018 · author #2
  10. On Computing Min-Degree Elimination Orderings cs.DS · 2017 · author #3
  11. Optimal Offline Dynamic $2,3$-Edge/Vertex Connectivity cs.DS · 2017 · author #1
  12. Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees cs.DS · 2017 · author #3
  13. Concave Flow on Small Depth Directed Networks cs.DS · 2017 · author #2
  14. Density Independent Algorithms for Sparsifying $k$-Step Random Walks cs.DS · 2017 · author #3
  15. A Framework for Analyzing Resparsification Algorithms cs.DS · 2016 · author #3
  16. Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs cs.DS · 2016 · author #4
  17. An Empirical Study of Cycle Toggling Based Laplacian Solvers cs.DS · 2016 · author #4
  18. Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More cs.DS · 2016 · author #4
  19. On Fully Dynamic Graph Sparsifiers cs.DS · 2016 · author #5
  20. Scalable Constrained Clustering: A Generalized Spectral Method cs.SI · 2016 · author #5
  21. Sparsified Cholesky and Multigrid Solvers for Connection Laplacians cs.DS · 2015 · author #3
  22. Sparsified Cholesky Solvers for SDD linear systems cs.DS · 2015 · author #2
  23. Spectral Sparsification of Random-Walk Matrix Polynomials cs.DS · 2015 · author #4
  24. $\ell_p$ Row Sampling by Lewis Weights cs.DS · 2014 · author #2
  25. Approximate Undirected Maximum Flows in O(m polylog(n)) Time cs.DS · 2014 · author #1
  26. Partitioning Well-Clustered Graphs: Spectral Clustering Works! cs.DS · 2014 · author #1
  27. A Generalized Cheeger Inequality cs.DM · 2014 · author #3
  28. Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models cs.DS · 2014 · author #4
  29. Uniform Sampling for Matrix Approximation cs.DS · 2014 · author #5
  30. Preconditioning in Expectation cs.DS · 2014 · author #4
  31. Stretching Stretch cs.DS · 2014 · author #4
  32. An Efficient Parallel Solver for SDD Linear Systems cs.NA · 2013 · author #1
  33. Improved Parallel Algorithms for Spanners and Hopsets cs.DS · 2013 · author #2
  34. Parallel Graph Decompositions Using Random Shifts cs.DS · 2013 · author #2
  35. Fully Dynamic $(1+\epsilon)$-Approximate Matchings cs.DS · 2013 · author #2
  36. Iterative Row Sampling cs.DS · 2012 · author #3
  37. Approximate Maximum Flow on Separable Undirected Graphs cs.DS · 2012 · author #2
  38. Faster spectral sparsification and numerical algorithms for SDD matrices cs.DS · 2012 · author #3
  39. Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows cs.DS · 2012 · author #3
  40. Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming cs.DS · 2012 · author #1
  41. Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs cs.DS · 2011 · author #5
  42. Runtime Guarantees for Regression Problems cs.DS · 2011 · author #4
  43. A nearly-mlogn time solver for SDD linear systems cs.DS · 2011 · author #3
  44. Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning cs.DS · 2010 · author #3
  45. Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge decomposition cs.DS · 2010 · author #2
  46. Approaching optimality for solving SDD systems cs.DS · 2010 · author #3

Mentions

  • 1311.3286 #1 · arxiv_oai · confidence 0.70 Richard Peng
  • 1506.08204 #2 · backfill · confidence 0.70 Richard Peng
  • 1111.1750 #5 · arxiv_oai · confidence 0.70 Richard Peng
  • 1502.03496 #4 · backfill · confidence 0.70 Richard Peng
  • 1412.6075 #3 · backfill · confidence 0.70 Richard Peng
  • 1412.0588 #2 · backfill · confidence 0.70 Richard Peng
  • 1411.7631 #1 · backfill · confidence 0.70 Richard Peng
  • 1411.2021 #1 · backfill · confidence 0.70 Richard Peng
  • 1410.5392 #4 · backfill · confidence 0.70 Richard Peng
  • 1408.5099 #5 · backfill · confidence 0.70 Richard Peng
  • 1401.6236 #4 · backfill · confidence 0.70 Richard Peng
  • 1401.2454 #4 · backfill · confidence 0.70 Richard Peng
  • 1311.3286 #1 · backfill · confidence 0.70 Richard Peng
  • 1309.3545 #2 · backfill · confidence 0.70 Richard Peng
  • 1307.3692 #2 · backfill · confidence 0.70 Richard Peng
  • 1304.0378 #2 · backfill · confidence 0.70 Richard Peng
  • 1211.2713 #3 · backfill · confidence 0.70 Richard Peng
  • 1210.5227 #2 · backfill · confidence 0.70 Richard Peng
  • 1209.5821 #3 · backfill · confidence 0.70 Richard Peng
  • 1202.3367 #3 · backfill · confidence 0.70 Richard Peng
  • 1201.5135 #1 · backfill · confidence 0.70 Richard Peng
  • 1111.1750 #5 · backfill · confidence 0.70 Richard Peng
  • 1110.1358 #4 · backfill · confidence 0.70 Richard Peng
  • 1102.4842 #3 · backfill · confidence 0.70 Richard Peng
  • 1011.0468 #3 · backfill · confidence 0.70 Richard Peng
  • 1003.4942 #2 · backfill · confidence 0.70 Richard Peng
  • 1003.2958 #3 · backfill · confidence 0.70 Richard Peng

Frequent Coauthors