45 citations · 75 across the 9 of their papers we have counts for
10 papers
Parallel batch queries on dynamic trees: algorithms and experiments
Humza Ikram, Andrew Brady, Daniel Anderson +1
Dynamic tree data structures maintain a forest while supporting insertion and deletion of edges and a broad set of queries in time per operation. Such data structures a…
Big Atomics
Daniel Anderson, Guy E. Blelloch, Siddhartha Jayanti
In this paper, we give theoretically and practically efficient implementations of Big Atomics, i.e., -word linearizable registers that support the load, store, and compare-and-s…
Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span
Daniel Anderson, Guy E. Blelloch
Dynamic trees are a well-studied and fundamental building block of dynamic graph algorithms dating back to the seminal work of Sleator and Tarjan [STOC'81, (1981), pp. 114-122]. Th…
Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
Safe memory reclamation (SMR) schemes are an essential tool for lock-free data structures and concurrent programming. However, manual SMR schemes are notoriously difficult to apply…
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…
Parallel Minimum Cuts in Work and Low Depth
Daniel Anderson, Guy E. Blelloch
We present a randomized work, depth parallel algorithm for minimum cut. This algorithm matches the work bounds of a recent sequential algorit…
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…
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…
Further Results on an Abstract Model for Branching and its Application to Mixed-Integer Programming
Daniel Anderson, Pierre Le Bodic, Kerri Morgan
A key ingredient in branch and bound (B&B) solvers for mixed-integer programming (MIP) is the selection of branching variables since poor or arbitrary selection can affect the size…
Parallel Batch-Dynamic Graph Connectivity
Umut A. Acar, Daniel Anderson, Guy E. Blelloch +1
In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting. Th…