Randomized binary searching with tree structures

Harry A. Clampett · Communications of the ACM · 1964

A more efficient method of using tree structures is proposed, which utilizes both plus and minus branches in the search path. Very significant gains result when the search key includes alphabetic characters.

Cited by 34 works. doi:10.1145/363958.363987 Open-access PDF

Authors

References