On tree-growing search strategies

DOI10.1214/AOAP/1035463333zbMath0870.60019OpenAlexW2001334887MaRDI QIDQ1354845

Hosam M. Mahmoud, Janice Lent

Publication date: 1 September 1997

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1035463333

zbMATH Keywords

sortingsearchinglimit distributions

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Searching and sorting (68P10)

Related Items (1)

Normality of tree-growing search strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort
• A note on the higher moments of the expected behavior of straight insertion sort
• Binary Search on a Tape

This page was built for publication: On tree-growing search strategies