On tree-growing search strategies

DOI10.1214/AOAP/1035463333MaRDI QIDQ1354845zbMATH OpenOpenAlexFDO

Authors Janice Lent, Hosam M. Mahmoud

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

limit distributionssearchingsorting

Mathematics Subject Classification ID

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

Recommendations

• Normality of tree-growing search strategies
• Analysis of the space of search trees under the random insertion algorithm
• On the joint distribution of the insertion path length and the number of comparisons in search trees
• The analysis of heuristics for search trees
• Search trees: metric aspects and strong limit theorems

Cites work

• A note on the higher moments of the expected behavior of straight insertion sort
• Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort
• Binary Search on a Tape
• scientific article; zbMATH DE number 4060392 (Why is no real title available?)
• The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera

Cited in

(4)

• Normality of tree-growing search strategies
• scientific article; zbMATH DE number 1305528 (Why is no real title available?)
• Searching a Tree with Permanently Noisy Advice
• Competitive Online Search Trees on Trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354845)