A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Construction of optimal binary split trees in the presence of bounded access probabilities
1988
Journal of Algorithms
A binary split tree is a search structure combining features of heaps and binary search trees. The fastest known algorithm for building an optimal binary split tree requires (n 4 ) time if the keys are distinct and O(n 5 ) time if the keys are non-distinct. (n 3 ) space is required in both cases. A modi cation is introduced which reduces a factor of n 2 in the asymptotic time to a factor of n lg(n) when the smallest probability of access of any key is (n ). This yields an asymptotic improvement
doi:10.1016/0196-6774(88)90040-5
fatcat:nb5lofcja5cchk7gcd37tqbv6u