Results 1  10
of
859,365
Selfadjusting binary search trees
, 1985
"... The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have an am ..."
Abstract

Cited by 435 (19 self)
 Add to MetaCart
The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have
On Optimal Binary Search Trees
"... We present a new linear time heuristic for constructing binary search trees. The analysis of the algorithm, by establishing an upper bound on the cost of the produced binary search trees, permits to derive a limitation on the cost of optimal binary search trees. The obtained upper bound improve on p ..."
Abstract
 Add to MetaCart
We present a new linear time heuristic for constructing binary search trees. The analysis of the algorithm, by establishing an upper bound on the cost of the produced binary search trees, permits to derive a limitation on the cost of optimal binary search trees. The obtained upper bound improve
Randomized Binary Search Trees
 Journal of the ACM
, 1997
"... In this paper we present randomized algorithms over binary search trees such that: a) the insertion of a set of keys, in any fixed order, into an initially empty tree always produces a random binary search tree; b) the deletion of any key from a random binary search tree results in a random binary s ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
In this paper we present randomized algorithms over binary search trees such that: a) the insertion of a set of keys, in any fixed order, into an initially empty tree always produces a random binary search tree; b) the deletion of any key from a random binary search tree results in a random binary
The geometry of binary search trees
 In Proceedings of the 20th ACMSIAM Symposium on Discrete Algorithms (SODA 2009
, 2009
"... We present a novel connection between binary search trees (BSTs) and points in the plane satisfying a simple property. Using this correspondence, we achieve the following results: 1. A surprisingly clean restatement in geometric terms of many results and conjectures relating to BSTs and dynamic opti ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We present a novel connection between binary search trees (BSTs) and points in the plane satisfying a simple property. Using this correspondence, we achieve the following results: 1. A surprisingly clean restatement in geometric terms of many results and conjectures relating to BSTs and dynamic
Restructuring Binary Search Trees Revisited
, 2005
"... this paper we show how, given one binary search tree T , we can construct another binary search tree Email address: travis@cs.toronto.edu (T. Gagie) ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
this paper we show how, given one binary search tree T , we can construct another binary search tree Email address: travis@cs.toronto.edu (T. Gagie)
Supernode Binary Search Trees
 International Journal on Foundations of Computer Science
"... this paper, we propose supernode versions of unbalanced binary search trees as well as of red black, AVL, and splay trees. We refer to these supernode varieties as BST(m), AVL(m), RB(m), and Splay(m). In a supernode BST (BST(m), m > 1) each node may have up to m elements. More precisely, a BST(m ..."
Abstract
 Add to MetaCart
this paper, we propose supernode versions of unbalanced binary search trees as well as of red black, AVL, and splay trees. We refer to these supernode varieties as BST(m), AVL(m), RB(m), and Splay(m). In a supernode BST (BST(m), m > 1) each node may have up to m elements. More precisely, a BST
Deamortizing Binary Search Trees
 In Automata, Languages, and Programming  39th International Colloquium, ICALP 2012
"... We present a general method for deamortizing essentially any Binary Search Tree (BST) algorithm. In particular, by transforming Splay Trees, our method produces a BST that has the same asymptotic cost as Splay Trees on any access sequence while performing each search in O(log n) worst case time. By ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We present a general method for deamortizing essentially any Binary Search Tree (BST) algorithm. In particular, by transforming Splay Trees, our method produces a BST that has the same asymptotic cost as Splay Trees on any access sequence while performing each search in O(log n) worst case time
Adaptive Binary Search Trees
, 2009
"... A ubiquitous problem in the field of algorithms and data structures is that of searching for an element from an ordered universe. The simple yet powerful binary search tree (BST) model provides a rich family of solutions to this problem. Although BSTs require Ω(lg n) time per operation in the wors ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A ubiquitous problem in the field of algorithms and data structures is that of searching for an element from an ordered universe. The simple yet powerful binary search tree (BST) model provides a rich family of solutions to this problem. Although BSTs require Ω(lg n) time per operation
Combining Binary Search Trees
"... Abstract. We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any “wellbehaved ” bound on the running time of the given BSTs, for any online access sequen ..."
Abstract
 Add to MetaCart
Abstract. We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any “wellbehaved ” bound on the running time of the given BSTs, for any online access
Martingales and Profile of Binary Search Trees
, 2004
"... We are interested in the asymptotic analysis of the binary search tree (BST) under the random permutation model. Via an embedding in a continuous time model, we get new results, in particular the asymptotic behavior of the profile. ..."
Abstract

Cited by 50 (10 self)
 Add to MetaCart
We are interested in the asymptotic analysis of the binary search tree (BST) under the random permutation model. Via an embedding in a continuous time model, we get new results, in particular the asymptotic behavior of the profile.
Results 1  10
of
859,365