APPLICATIONS OF THE THEORY OF RECORDS IN THE STUDY OF RANDOM TREES

被引:68
作者
DEVROYE, L
机构
关键词
D O I
10.1007/BF02915448
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:123 / 130
页数:8
相关论文
共 20 条
[1]  
Aho A.V., 1983, DATA STRUCTURES ALGO
[2]  
Aho AV., 1975, DESIGN ANAL COMPUTER
[3]   ON RANDOM BINARY-TREES [J].
BROWN, GG ;
SHUBERT, BO .
MATHEMATICS OF OPERATIONS RESEARCH, 1984, 9 (01) :43-65
[4]   A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J].
CHERNOFF, H .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :493-507
[5]  
CHOW YS, 1978, PROBABILITY THEORY
[6]   A NOTE ON THE HEIGHT OF BINARY SEARCH-TREES [J].
DEVROYE, L .
JOURNAL OF THE ACM, 1986, 33 (03) :489-498
[7]  
DEVROYE L, 1987, ACTA INFORM, V24, P277, DOI 10.1007/BF00265991
[8]  
Doyle J., 1976, Information Processing Letters, V5, P146, DOI 10.1016/0020-0190(76)90061-2
[9]   BREAKING RECORDS AND BREAKING BOARDS [J].
GLICK, N .
AMERICAN MATHEMATICAL MONTHLY, 1978, 85 (01) :2-26
[10]  
HOFRI M, 1987, PROBABILISTIC ANAL A