Results 1  10
of
4,507
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 432 (18 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
Generalized binary search
 In Proceedings of the 46th Allerton Conference on Communications, Control, and Computing
, 2008
"... This paper addresses the problem of noisy Generalized Binary Search (GBS). GBS is a wellknown greedy algorithm for determining a binaryvalued hypothesis through a sequence of strategically selected queries. At each step, a query is selected that most evenly splits the hypotheses under consideratio ..."
Abstract

Cited by 59 (0 self)
 Add to MetaCart
This paper addresses the problem of noisy Generalized Binary Search (GBS). GBS is a wellknown greedy algorithm for determining a binaryvalued hypothesis through a sequence of strategically selected queries. At each step, a query is selected that most evenly splits the hypotheses under
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
Compressive binary search
 In Proc. IEEE Int. Symp. Inform. Theory (ISIT
, 2012
"... Abstract—In this paper we consider the problem of locating a nonzero entry in a highdimensional vector from possibly adaptive linear measurements. We consider a recursive bisection method which we dub the compressive binary search and show that it improves on what any nonadaptive method can achieve ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract—In this paper we consider the problem of locating a nonzero entry in a highdimensional vector from possibly adaptive linear measurements. We consider a recursive bisection method which we dub the compressive binary search and show that it improves on what any nonadaptive method can
On some generalizations of binary search
 ACM Symposium on the Theory of Computing
, 1974
"... Classic binary search is extended to multidimensional search problems. These new search methods can efficiently solve several important problems of computer science. Applications of these results to an open problem in the theory of computation are discussed yielding new insight into the Lba problem. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Classic binary search is extended to multidimensional search problems. These new search methods can efficiently solve several important problems of computer science. Applications of these results to an open problem in the theory of computation are discussed yielding new insight into the Lba problem
A Verification of Binary Search
 Mechanizing Mathematical Reasoning: Techniques, Tools and Applications, volume 2605 of LNAI
, 2003
"... Abstract. We demonstrate the use of theXeriFun system with a verification of the Binary Search method. We present the challenges encountered when working on this problem, illustrate the operation and performance of the system and finally discuss technical improvements as well as subjects of furth ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We demonstrate the use of theXeriFun system with a verification of the Binary Search method. We present the challenges encountered when working on this problem, illustrate the operation and performance of the system and finally discuss technical improvements as well as subjects
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 12 (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
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
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 48 (11 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
4,507