"Expected number of passes in a binary search scheme."

Aaron Tenenbein (1974)

> Home

Details and statistics

DOI: 10.1016/0020-0271(74)90040-0

access: closed

type: Journal Article

metadata version: 2020-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipm/Tenenbein74
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipm/Tenenbein74
Aaron Tenenbein:
Expected number of passes in a binary search scheme. Inf. Storage Retr. 10(1): 29-32 (1974)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.