The effect of updates in binary search trees
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Algorithms (2nd ed.)
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
The design and analysis of algorithms
The design and analysis of algorithms
Randomized algorithms
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Self-Organizing Binary Search Trees
Journal of the ACM (JACM)
An empirical study of insertion and deletion in binary search trees
Communications of the ACM
Randomization of Search Trees by Subtree Size
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Deletion in binary storage trees.
Deletion in binary storage trees.
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
A New Method for Balancing Binary Search Trees
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Randomized K-Dimensional Binary Search Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Emerging behavior as binary search trees are symmetrically updated
Theoretical Computer Science - Latin American theoretical informatics
Experiments with balanced-sample binary trees
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Nordic Journal of Computing
Exploring the duality between skip lists and binary search trees
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Randomness Preserving Deletions on Special Binary Search Trees
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Algorithms (TALG)
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Note: Random binary search tree with equal elements
Theoretical Computer Science
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Skip lift: a probabilistic alternative to red-black trees
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Rank selection in multidimensional data
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Randomized insertion and deletion in point quad trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Network of shortcuts: an adaptive data structure for tree-based search methods
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Skip lift: A probabilistic alternative to red-black trees
Journal of Discrete Algorithms
Fibonacci BSTs: A new balancing method for binary search trees
Theoretical Computer Science
Faster and smaller inverted indices with treaps
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.01 |
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 search tree; (c) the random choices made by the algorithms are based upon the sizes of the subtrees of the tree; this implies that we can support accesses by rank without additional storage requirements or modification of the data structures; and (d) the cost of any elementary operation, measured as the number of visited nodes, is the same as the expected cost of its standard deterministic counterpart; hence, all search and update operations have guaranteed expected cost O(log n), but now irrespective of any assumption on the input distribution.