Searching for "Scapegoat Trees." – sorted by Relevance.
-
On Consulting a Set of Experts and Searching
- approximate solution of the s-median problem. The third and last chapter is dedicated to the Scapegoat trees
- Add To MetaCart
-
time rebuilding the tree. So the overall expected time for a
- part (a).] Solution: This follows by precisely the same analysis as for scapegoat trees, since we now
- Add To MetaCart
-
Randomized Search Trees
- new scheme called "scapegoat trees," which also needs basically no balance information at all
- Cited by 105 (1 self) – Add To MetaCart
-
binary search trees. (I know, I promised I wouldn't do much geometry, but this was sort of irresistible.)
- , but not for splay trees or scapegoat trees!) Thus, after O(n) insertions and deletions, a persistent treap still
- Add To MetaCart
-
Amortized Complexity of Data Structures
- 's Scapegoat Tree [18] take O(log n) amortized time per operation. There is no hope of improving the log n
- Cited by 1 (0 self) – Add To MetaCart

