The analysis of heuristics for search trees

DOI10.1007/BF01179372zbMath0790.68027OpenAlexW2045332380MaRDI QIDQ1323337

Patricio V. Poblete

Publication date: 10 May 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01179372

zbMATH Keywords

data structuressearch treesdistribution of search time

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematics for the analysis of algorithms.
• Improving time and space efficiency in generalized binary search trees
• Non-negative matrices and Markov chains. 2nd ed
• Fringe analysis for extquick: An in situ distributive external sorting algorithm
• The analysis of a fringe heuristic for binary search trees
• Fault tolerance and storage reduction in binary search trees

This page was built for publication: The analysis of heuristics for search trees