112 citations · 370 across the 54 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Batch-Parallel Euler Tour Trees
Thomas Tseng, Laxman Dhulipala, Guy Blelloch
The dynamic trees problem is to maintain a forest undergoing edge insertions and deletions while supporting queries for information such as connectivity. There are many existing da…
cs.DS2018★ 97 cited
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
There has been significant recent interest in parallel graph processing due to the need to quickly analyze the large graphs available today. Many graph codes have been designed for…