On the efficiency of a new method of dictionary construction

DOI10.1016/S0019-9958(60)90901-3MaRDI QIDQ3284958zbMATH OpenOpenAlexFDO

Authors Andrew D. Booth, Andrew J. T. Colin

Publication date 1961

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(60)90901-3

zbMATH Keywords

numerical analysis

Cited in

(8)

• Deletions in random binary search trees: a story of errors
• Profiles of random trees: correlation and width of random recursive trees and binary search trees
• Optimum binary search trees
• Analysis of the standard deletion algorithms in exact fit domain binary search trees
• An Improved Bound for Random Binary Search Trees with Concurrent Insertions
• Succinct encodings of binary trees with application to AVL trees
• Bottom-up rebalancing binary search trees by flipping a coin
• The properties of random trees

This page was built for publication: On the efficiency of a new method of dictionary construction

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