Expected number of passes in a binary search scheme.
| Anthology ID: | DBLP:journals/ipm/Tenenbein74 |
|---|---|
| Year: | 1974 |
| Venue: | Information Processing and Management |
| Pages: | 29-32 |
| URL: | https://doi.org/10.1016/0020-0271(74)90040-0 |
| DOI: | https://doi.org/10.1016/0020-0271(74)90040-0 |
| DBLP: | journals/ipm/Tenenbein74 |
| BibTeX: |
@article{tenenbein-1974-expected,
author = {Aaron Tenenbein},
title = {{Expected number of passes in a binary search scheme}},
journal = {Information Processing and Management},
volume = {10},
number = {1},
pages = {29--32},
year = {1974},
url = {https://doi.org/10.1016/0020-0271(74)90040-0},
doi = {https://doi.org/10.1016/0020-0271(74)90040-0}
}