Dynamic Optimality Refuted -- For Tournament Heaps

Cited by: 0|Bibtex|Views13|Links

Abstract:

We prove a separation between offline and online algorithms for finger-based tournament heaps undergoing key modifications. These heaps are implemented by binary trees with keys stored on leaves, and intermediate nodes tracking the min of their respective subtrees. They represent a natural starting point for studying self-adjusting heap...More

Code:

Data:

Your rating :
0

 

Tags
Comments