14 citations · 33 across the 6 of their papers we have counts for
7 papers
A Note on a Recent Attempt to Prove the Irrationality of
Keyu Chen, Wei He, Yixin He +7
Recently Shekhar Suman [arXiv: 2407.07121v6 [math.GM] 3 Aug 2024] made an attempt to prove the irrationality of . But unfortunately the proof is not correct. In this note, we…
Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Matthew Fahrbach, Gary L. Miller, Richard Peng +3
Motivated by the study of matrix elimination orderings in combinatorial scientific computing, we utilize graph sketching and local sampling to give a data structure that provides a…
On Computing Min-Degree Elimination Orderings
Matthew Fahrbach, Gary L. Miller, Richard Peng +3
We study faster algorithms for producing the minimum degree ordering used to speed up Gaussian elimination. This ordering is based on viewing the non-zero elements of a symmetric p…
An Empirical Study of Cycle Toggling Based Laplacian Solvers
Kevin Deweese, John R. Gilbert, Gary Miller +3
We study the performance of linear solvers for graph Laplacians based on the combinatorial cycle adjustment methodology proposed by [Kelner-Orecchia-Sidford-Zhu STOC-13]. The appro…
Stretching Stretch
Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki +2
We give a generalized definition of stretch that simplifies the efficient construction of low-stretch embeddings suitable for graph algorithms. The generalization, based on discoun…
Improved Parallel Algorithms for Spanners and Hopsets
Gary L. Miller, Richard Peng, Adrian Vladu +1
We use exponential start time clustering to design faster and more work-efficient parallel graph algorithms involving distances. Previous algorithms usually rely on graph decomposi…
Parallel Graph Decompositions Using Random Shifts
Gary L. Miller, Richard Peng, Shen Chen Xu
We show an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between. These decompositions…