Publication:4262416
From MaRDI portal
DOI<25::AID-RSA2>3.0.CO;2-R 10.1002/(SICI)1098-2418(199908)15:1<25::AID-RSA2>3.0.CO;2-RzbMath0927.68030MaRDI QIDQ4262416
Ludger Rüschendorf, Ralph Neininger
Publication date: 29 November 1999
68P10: Searching and sorting
Related Items
Unnamed Item, A general limit theorem for recursive algorithms and combinatorial structures, On binary search tree recursions with monomials as toll functions, Limit laws for partial match queries in quadtrees, D?E?K=(1000)8, Phase changes in randomm-ary search trees and generalized quicksort, On a multivariate contraction method for random recursive structures with applications to Quicksort
Cites Work
- Unnamed Item
- On the average internal path length of m-ary search trees
- Branching processes in the analysis of the heights of trees
- A fixed point theorem for distributions
- Analytic variations on quadtrees
- Quad trees: A data structure for retrieval by composite keys
- An Analysis of Randomd-Dimensional Quad Trees
- The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications
- A limiting distribution for quicksort
- A note on the height of binary search trees
- Universal Limit Laws for Depths in Random Trees
- Hypergeometrics and the cost structure of quadtrees
- A limit theorem for “quicksort”