Branching processes in the analysis of the heights of trees
Acta Informatica
The design and analysis of spatial data structures
The design and analysis of spatial data structures
An analysis of random d-dimensional quad trees
SIAM Journal on Computing
Randomized algorithms
Randomized binary search trees
Journal of the ACM (JACM)
An empirical study of insertion and deletion in binary search trees
Communications of the ACM
Deletion in two-dimensional quad trees
Communications of the ACM
Randomized K-Dimensional Binary Search Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Hi-index | 0.00 |
In this work we introduce randomized insertion and deletion algorithms for quad trees These algorithms are simple and they are defined for any dimension K (where K is a natural number), in contrast with the fact that standard deletion in quad trees is rather complicated and becomes more cumbersome as K increases [12] In addition, in online applications, where long sequences of random interleaved insertions and deletions are performed, quad trees built and dynamically maintained by the randomized algorithms presented here (randomized quad trees) preserve their expected path length, a measure that augments when, in similar circumstances, the standard deletion algorithm is used [4] Moreover, the expected values of random variables (such as internal path length, depth, cost of successful or unsuccessful search, cost of partial match queries, between others) given in the literature for random quad trees are valid for the randomized quad trees introduced in this work.