Daniel Anderson

activity

20192025

most citedParallel Batch-Dynamic Graph Connectivity

45 citations · 75 across the 9 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DC2021

Efficient Parallel Self-Adjusting Computation

Daniel Anderson, Guy E. Blelloch, Anubhav Baweja +1

Self-adjusting computation is an approach for automatically producing dynamic algorithms from static ones. The approach works by tracking control and data dependencies, and propaga…

cs.DS2021★ 3 cited

Parallel Minimum Cuts in $O (m lo g^{2} (n))$ Work and Low Depth

Daniel Anderson, Guy E. Blelloch

We present a randomized $O (m lo g^{2} n)$ work, $O (polylog n)$ depth parallel algorithm for minimum cut. This algorithm matches the work bounds of a recent sequential algorit…

Efficient Parallel Self-Adjusting Computation

Parallel Minimum Cuts in O(mlog2(n)) Work and Low Depth

Parallel Minimum Cuts in $O (m lo g^{2} (n))$ Work and Low Depth