Trees, Forests and Rearranging

DOI10.1093/COMJNL/3.2.84MaRDI QIDQ3270168zbMATH OpenOpenAlexFDO

Authors P. F. Windley

Publication date 1960

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/3.2.84

zbMATH Keywords

numerical analysis

Cited in

(11)

• Deletions in random binary search trees: a story of errors
• Sequence search trees: Their analysis using recurrence relations
• Sortierprozesse auf elektronischen Rechenanlagen
• On file structuring for non-uniform access frequencies
• Optimal binary search methods
• Profiles of random trees: correlation and width of random recursive trees and binary search trees
• Optimum binary search trees
• A method for constructing binary search trees by making insertions at the root
• Analysis of the standard deletion algorithms in exact fit domain binary search trees
• An Improved Bound for Random Binary Search Trees with Concurrent Insertions
• The properties of random trees

This page was built for publication: Trees, Forests and Rearranging

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