Randomized binary search technique

Authors:
S. R. Arora;W. T. Dent
Affiliations:
Univ. of Minnesota, Minneapolis;Univ. of Minnesota, Minneapolis
Venue:
Communications of the ACM
Year:
1969

Citing 2
Cited 10

Randomized binary searching with tree structures

Communications of the ACM
Use of tree structures for processing files

Communications of the ACM

Tree Structures for Optimal Searching

Journal of the ACM (JACM)
An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys

Journal of the ACM (JACM)
Identifier Search Mechanisms: A Survey and Generalized Model

ACM Computing Surveys (CSUR)
Analysis of design alternatives for virtual memory indexes

Communications of the ACM
Adaptive correction of program statements

Communications of the ACM
Design of tree structures for efficient querying

Communications of the ACM
Emerging behavior as binary search trees are symmetrically updated

Theoretical Computer Science - Latin American theoretical informatics
Comparisons in Hoare's Find Algorithm

Combinatorics, Probability and Computing
A graduate course in database management

ACM SIGMOD Record
Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	48.27

Visualization

Abstract

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.