Balancing \(m\)-ary search trees with compressions on the fringe
From MaRDI portal
Publication:6150114
DOI10.1007/s00236-023-00448-2OpenAlexW4389794377MaRDI QIDQ6150114
Hosam M. Mahmoud, Shuyang Gao, Leen Hatem
Publication date: 5 March 2024
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-023-00448-2
Central limit and other weak theorems (60F05) Trees (05C05) Searching and sorting (68P10) Combinatorial probability (60C05) Data structures (68P05) Information storage and retrieval of data (68P20) Theory of computing (68Qxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rotations in fringe-balanced binary trees
- An analytic approach for the analysis of rotations in fringe-balanced binary search trees
- On the expected height of fringe-blanced trees
- Central limit theorems for urn models
- Phase changes in randomm-ary search trees and generalized quicksort
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
- Polya Urn Models
- The analysis of a fringe heuristic for binary search trees
- A limiting distribution for quicksort
- Analysis of the space of search trees under the random insertion algorithm
- Mean and variance of balanced Pólya urns
This page was built for publication: Balancing \(m\)-ary search trees with compressions on the fringe
