21 citations · 26 across the 5 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010
Searching in Dynamic Tree-Like Partial Orders
Brent Heeringa, Marius Catalin Iordan, Louis Theran
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tre…
cs.DS2010
Heapable Sequences and Subsequences
John Byers, Brent Heeringa, Michael Mitzenmacher +1
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at…