Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121): Difference between revisions

@@ Property / cites work @@
+Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
+Normal rank
@@ Property / cites work @@
+Approaching Optimality for Solving SDD Linear Systems
+Normal rank
@@ Property / cites work @@
+A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
+Normal rank
@@ Property / cites work @@
+An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
+Normal rank
@@ Property / cites work @@
+Approximate Undirected Maximum Flows in <i>O</i>(<i>m</i>polylog(<i>n</i>)) Time
+Normal rank
@@ Property / cites work @@
+Distributed verification and hardness of distributed approximation
+Normal rank
@@ Property / cites work @@
+Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
+Normal rank
@@ Property / cites work @@
+Low-Congestion Shortcuts without Embedding
@@ Property / cites work: Low-Congestion Shortcuts without Embedding / rank @@
+Normal rank
@@ Property / cites work @@
+Near-optimal low-congestion shortcuts on bounded parameter graphs
+Normal rank
@@ Property / cites work @@
+Universally-optimal distributed algorithms for known topologies
+Normal rank
@@ Property / cites work @@
+Shortest Paths in a Hybrid Network Model
@@ Property / cites work: Shortest Paths in a Hybrid Network Model / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Shortest Paths and Diameter in the Hybrid Network Model
+Normal rank
@@ Property / cites work @@
+Time-optimal construction of overlay networks
@@ Property / cites work: Time-optimal construction of overlay networks / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient parallel solver for SDD linear systems
+Normal rank
@@ Property / cites work @@
+Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds
+Normal rank
@@ Property / cites work @@
+On the power of the congested clique model
@@ Property / cites work: On the power of the congested clique model / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+Near-Optimal Scheduling of Distributed Algorithms
@@ Property / cites work: Near-Optimal Scheduling of Distributed Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Simple distributed \(\Delta+1\)-coloring of graphs
+Normal rank
@@ Property / cites work @@
+Near-Optimal Distributed Maximum Flow
@@ Property / cites work: Near-Optimal Distributed Maximum Flow / rank @@
+Normal rank
@@ Property / cites work @@
+A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem
+Normal rank
@@ Property / cites work @@
+Sparsified Cholesky and multigrid solvers for connection laplacians
+Normal rank
@@ Property / cites work @@
+Fully dynamic spectral vertex sparsifiers and applications
+Normal rank
@@ Property / cites work @@
+Q4607992
@@ Property / cites work: Q4607992 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302080
@@ Property / cites work: Q5302080 / rank @@
+Normal rank
@@ Property / cites work @@
+Lx = b
@@ Property / cites work: Lx = b / rank @@
+Normal rank
@@ Property / cites work @@
+A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
+Normal rank
@@ Property / cites work @@
+Stable distributions, pseudorandom generators, embeddings, and data stream computation
+Normal rank
@@ Property / cites work @@
+Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
+Normal rank