Lawrence Li

most citedHow fast can you update your MST? (Dynamic algorithms for cluster computing)

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2022

A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs

Lawrence Li, Sushant Sachdeva

We demonstrate that for expander graphs, for all $ε > 0,$ there exists a data structure of size $O (n ε^{- 1})$ which can be used to return $(1 + ε)$ -approximations to effe…

cs.DC2020★ 1 cited

How fast can you update your MST? (Dynamic algorithms for cluster computing)

Seth Gilbert, Lawrence Li

Imagine a large graph that is being processed by a cluster of computers, e.g., described by the $k$ -machine model or the Massively Parallel Computation Model. The graph, however, i…