45 citations · 75 across the 9 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 12 cited
Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model
Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan
Algorithms for dynamically maintaining minimum spanning trees (MSTs) have received much attention in both the parallel and sequential settings. While previous work has given optima…
cs.DS2020★ 9 cited
Parallel Batch-dynamic Trees via Change Propagation
Umut A. Acar, Daniel Anderson, Guy E. Blelloch +2
The dynamic trees problem is to maintain a forest subject to edge insertions and deletions while facilitating queries such as connectivity, path weights, and subtree weights. Dynam…