14 citations · 20 across the 2 of their papers we have counts for
2 papers
cs.DS2016★ 6 cited
Fully Dynamic Connectivity in Amortized Expected Time
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz +2
Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure with $O(\log n(\log\…
cs.DS2002★ 14 cited
Efficient Tree Layout in a Multilevel Memory Hierarchy
Stephen Alstrup, Michael A. Bender, Erik D. Demaine +3
We consider the problem of laying out a tree with fixed parent/child structure in hierarchical memory. The goal is to minimize the expected number of block transfers performed duri…