An almost optimal algorithm for unbounded searching

Information Processing Letters

Volumn 5, Issue 3, 1976, Pages 82-87

  Bentley, Jon Louis ^a   Yao, Andrew Chi Chih ^b  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

analysis of algorithms; optimal algorithms; Ordered table searching; representation of integers

Indexed keywords

EID: 0002187292     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(76)90071-5     Document Type: Article

References (6)

1. Universal codework sets and representation of the integers
2. Economical encoding of commas between strings
3. General methods for parallel searching
4. R.M. Karp and W.L. Mirankier, Parallel minimax search for a maximum. J. of Comb. Theory 4, pp. 19–35.