Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Randomized binary searching with tree structures
Home
Publications
Randomized binary searching with tree structures
Randomized binary searching with tree structures
Author:
HC
Harry A. Clampett
Harry A. Clampett
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Open Access
Publisher website
Google Scholar
1 March 1964
journal article
Published by
Association for Computing Machinery (ACM)
in
Communications of the ACM
Vol. 7
(3)
,
163-165
DOI:
10.1145/363958.363987
Abstract
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.
Keywords
RANDOMIZED BINARY
SEARCH KEY
TREE STRUCTURE
MINUS BRANCH
SEARCH PATH
EFFICIENT METHOD
SIGNIFICANT GAINS RESULT
ALPHABETIC CHARACTER
BINARY SEARCH
Related articles
Cited
Cited by 23 articles
Scroll to top