Randomized binary search technique
From MaRDI portal
Publication:5554721
DOI10.1145/362848.362856zbMath0167.45901OpenAlexW2045283155MaRDI QIDQ5554721
Publication date: 1969
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/362848.362856
Related Items (8)
One-sided variations on binary search trees ⋮ Binary search trees constructed from nondistinct keys with/without specified probabilities ⋮ Average-case analysis of multiple Quickselect: An algorithm for finding order statistics ⋮ Emerging behavior as binary search trees are symmetrically updated. ⋮ The \(m\)-version of binary search trees: an average case analysis ⋮ Random binary trees: from the average case analysis to the asymptotics of distributions ⋮ A principle of independence for binary tree searching ⋮ Mixed Poisson approximation of node depth distributions in random binary search trees
This page was built for publication: Randomized binary search technique
