Lawrence Li

activity

20202025

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

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

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025

Generalized Flow in Nearly-linear Time on Moderately Dense Graphs

Shunhua Jiang, Michael Kapralov, Lawrence Li +1

In this paper we consider generalized flow problems where there is an $m$ -edge $n$ -node directed graph $G = (V, E)$ and each edge $e \in E$ has a loss factor $γ_{e} > 0$ governing whet…

cs.DS2023

Fast Algorithms for Separable Linear Programs

Sally Dong, Gramoz Goranci, Lawrence Li +2

In numerical linear algebra, considerable effort has been devoted to obtaining faster algorithms for linear systems whose underlying matrices exhibit structural properties. A promi…

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…