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
- On Representatives of Subsets
- Theorie der endlichen und unendlichen Graphen
- An Algorithm for Distinct Representatives
- Combinatorial Properties of Matrices of Zeros and Ones
- The Construction of Class-Teacher Time-Tables.
- Two Algorithms for Bipartite Graphs
- Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems
- Matrices Associated With the Hitchcock Problem