Add to ORKGIn this paper we perform an amortized analysis of a functional program for splaying. We construct a potential function that yields the same bound for the amortized cost of splaying as given by D.D. Sleator and R.E. Tarjan—the inventors of splay trees. In addition, we show that this bound is minimal for the class of “sum of logs ” potentials. Our approach also applies to the analysis of path reversal and pairing heaps
Splay trees, a type of self-adjusting search tree, are introduced and analyzed. Since they have been...
AbstractWe give a new, simple proof for the sequential access theorem for splay trees. For an n-node...
Magister Scientiae - MScOur main results are that splay trees are faster for sorted insertion, where...
In this paper we perform an amortized analysis of a functional program for splaying. We construct a ...
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the earl...
AbstractSplay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in ...
We propose a framework for studying bottom-up restructuring heuristics for binary search trees. We i...
Splay trees are self-adjusting binary search trees which were in-vented by Sleator and Tarjan [1]. T...
Access requests to keys stored into a data structure often exhibit locality of reference in practice...
Splay trees are widely considered as the classic examples of self-adjusting binary search trees and ...
This note improves upon an earlier analysis of the author's [2]. Using methods from that paper,...
\u3cp\u3eThe pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewic...
The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleato...
Splay trees (Sleator and Tarjan) satisfy the so-called access lemma. Many of the nice properties of ...
In this paper we prove that if the nodes of an arbitrary n-node binary search tree T are splayed in ...
Splay trees, a type of self-adjusting search tree, are introduced and analyzed. Since they have been...
AbstractWe give a new, simple proof for the sequential access theorem for splay trees. For an n-node...
Magister Scientiae - MScOur main results are that splay trees are faster for sorted insertion, where...
In this paper we perform an amortized analysis of a functional program for splaying. We construct a ...
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the earl...
AbstractSplay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in ...
We propose a framework for studying bottom-up restructuring heuristics for binary search trees. We i...
Splay trees are self-adjusting binary search trees which were in-vented by Sleator and Tarjan [1]. T...
Access requests to keys stored into a data structure often exhibit locality of reference in practice...
Splay trees are widely considered as the classic examples of self-adjusting binary search trees and ...
This note improves upon an earlier analysis of the author's [2]. Using methods from that paper,...
\u3cp\u3eThe pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewic...
The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleato...
Splay trees (Sleator and Tarjan) satisfy the so-called access lemma. Many of the nice properties of ...
In this paper we prove that if the nodes of an arbitrary n-node binary search tree T are splayed in ...
Splay trees, a type of self-adjusting search tree, are introduced and analyzed. Since they have been...
AbstractWe give a new, simple proof for the sequential access theorem for splay trees. For an n-node...
Magister Scientiae - MScOur main results are that splay trees are faster for sorted insertion, where...