On the internal path length ofd-dimensional quad trees
- 1 August 1999
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 15 (1) , 25-41
- https://doi.org/10.1002/(sici)1098-2418(199908)15:1<25::aid-rsa2>3.0.co;2-r
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Universal Limit Laws for Depths in Random TreesSIAM Journal on Computing, 1998
- Hypergeometrics and the cost structure of quadtreesRandom Structures & Algorithms, 1995
- Search costs in quadtrees and singularity perturbation asymptoticsDiscrete & Computational Geometry, 1994
- Analytic variations on quadtreesAlgorithmica, 1993
- An Analysis of Randomd-Dimensional Quad TreesSIAM Journal on Computing, 1990
- Branching processes in the analysis of the heights of treesActa Informatica, 1987
- A note on the height of binary search treesJournal of the ACM, 1986
- On the average internal path length of m-ary search treesActa Informatica, 1986
- The Monge–Kantorovich Mass Transference Problem and Its Stochastic ApplicationsTheory of Probability and Its Applications, 1985
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974