An almost optimal algorithm for unbounded searching

Jon Louis Bentley; Andrew Chi Chih Yao

doi:10.1016/0020-0190(76)90071-5

An almost optimal algorithm for unbounded searching

Jon Louis Bentley
, Andrew Chi Chih Yao

电子与信息学部

University of North Carolina at Chapel Hill

科研成果: 期刊稿件 › 文章 › 同行评审

255 引用（Scopus）

源语言	英语
页（从-至）	82-87
页数	6
期刊	Information Processing Letters
卷	5
期	3
DOI	https://doi.org/10.1016/0020-0190(76)90071-5
出版状态	已出版 - 8月 1976

访问文件

10.1016/0020-0190(76)90071-5

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{fe4357466ec94c76bbe2b947d97f3c4b,

title = "An almost optimal algorithm for unbounded searching",

keywords = "analysis of algorithms, optimal algorithms, Ordered table searching, representation of integers",

author = "Bentley, \{Jon Louis\} and Yao, \{Andrew Chi Chih\}",

year = "1976",

month = aug,

doi = "10.1016/0020-0190(76)90071-5",

language = "英语",

volume = "5",

pages = "82--87",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - An almost optimal algorithm for unbounded searching

AU - Bentley, Jon Louis

AU - Yao, Andrew Chi Chih

PY - 1976/8

Y1 - 1976/8

KW - analysis of algorithms

KW - optimal algorithms

KW - Ordered table searching

KW - representation of integers

UR - https://www.scopus.com/pages/publications/0002187292

U2 - 10.1016/0020-0190(76)90071-5

DO - 10.1016/0020-0190(76)90071-5

M3 - 文章

AN - SCOPUS:0002187292

SN - 0020-0190

VL - 5

SP - 82

EP - 87

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -