AN ALMOST OPTIMAL ALGORITHM FOR UNBOUNDED SEARCHING (1975)
by
Jon Louis Bentley
,
Andrew Chi-chih Yao
| Citations: | 46 - 0 self |
BibTeX
@MISC{Bentley75analmost,
author = {Jon Louis Bentley and Andrew Chi-chih Yao},
title = { AN ALMOST OPTIMAL ALGORITHM FOR UNBOUNDED SEARCHING},
year = {1975}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 1106 | Information Theory and Reliable Communication - Gallager - 1968 |
| 283 | Universal codeword sets and representations of the integers - Elias - 1975 |
| 7 | Parallel minimax search for a maximum - Karp, Mirankier |
| 4 | General methods for parallel searching - Linn - 1973 |
| 1 | Economical encoding of commas between strings." TEmION - Even, Rodeh - 1975 |
