The size of random fragmentation trees
- 22 November 2007
- journal article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 142 (3-4) , 399-442
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Phase changes in random point quadtreesACM Transactions on Algorithms, 2007
- Random Fragmentation and Coagulation Processes2006
- m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirementsRandom Structures & Algorithms, 2004
- Asymptotic Laws for Nonconservative Self-similar FragmentationsElectronic Journal of Probability, 2004
- Phase transition in a random fragmentation problem with applications to computer scienceJournal of Physics A: General Physics, 2002
- Phase changes in random m‐ary search trees and generalized quicksortRandom Structures & Algorithms, 2001
- Counting intervals in the packing processThe Annals of Applied Probability, 2001
- Splitting intervals II: Limit laws for lengthsProbability Theory and Related Fields, 1987
- Splitting IntervalsThe Annals of Probability, 1986
- Some Asymptotic Theory for the BootstrapThe Annals of Statistics, 1981