On the efficiency of a new method of dictionary construction
From MaRDI portal
Publication:3284958
DOI10.1016/S0019-9958(60)90901-3zbMath0102.12303OpenAlexW2050862204MaRDI QIDQ3284958
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
Related Items
An Improved Bound for Random Binary Search Trees with Concurrent Insertions ⋮ Analysis of the standard deletion algorithms in exact fit domain binary search trees ⋮ Profiles of random trees: correlation and width of random recursive trees and binary search trees ⋮ Deletions in random binary search trees: a story of errors ⋮ Optimum binary search trees ⋮ The properties of random trees
This page was built for publication: On the efficiency of a new method of dictionary construction