Subramanian, Ashok (1996) An Explanation of Splaying. In: Journal of Algorithms, 20 (3). pp. 512-525.
Restricted to Registered users only
Download (126Kb) | Request a copy
We propose a framework for studying bottom-up restructuring heuristics for binary search trees. We identify the key role played by depth-reducing rules in obtaining logarithmic amortized cost per access. We show that splaying is by no means the only heuristic that offers logarithmic amortized cost.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Academic Press.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||12 Jan 2007|
|Last Modified:||19 Sep 2010 04:33|
Actions (login required)