EXPECTED TIME BOUNDS FOR SELECTION

被引：146

作者：

FLOYD, RW ^{[1
]}

RIVEST, RL ^{[1
]}

机构：

[1] STANFORD UNIV,COMP SCI DEPT,STANFORD,CA 94305

来源：

关键词：

D O I：

10.1145/360680.360691

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：165 / 172

页数：8

共 7 条

[1] Blum M., 1973, Journal of Computer and System Sciences, V7, P448, DOI 10.1016/S0022-0000(73)80033-9
[2] ALGORITHM SELECT - FOR FINDING ITH SMALLEST OF N-ELEMENTS [M1]
FLOYD, RW
RIVEST, RL
[J]. COMMUNICATIONS OF THE ACM, 1975, 18 (03) : 173 - 173
[3] Hoare C. A. R., 1961, COMMUN ACM, V4, P321, DOI [DOI 10.1145/366622.366644, 10.1145/366622.366647, DOI 10.1145/366622.366647]
[4] KNUTH DE, 1971, STANCS71206 STANF U
[5] LINDGREN BW, 1962, STATISTICAL THEORY
[6] RIVEST RL, 1973, 9 COUR COMP SCIENC S, P69
[7] MINIT ALGORITHM FOR LINEAR PROGRAMMING
SALAZAR, RC
SEN, SK
[J]. COMMUNICATIONS OF THE ACM, 1968, 11 (06) : 437 - &