ACM

Communications of the ACM

Home/Magazine Archive/February 1969 (Vol. 12, No. 2)/Randomized binary search technique/Abstract

Randomized binary search technique

By S. R. Arora, W. T. Dent
Communications of the ACM, February 1969, Vol. 12 No. 2, Pages 77-80
10.1145/362848.362856
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

A mathematical model is developed for the mean and variance of the number of trials to recover a given document in a randomly received list of files. The search method described is binary in nature and offers new potential for information retrieval systems.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.