PATHS IN A RANDOM DIGITAL TREE - LIMITING DISTRIBUTIONS

被引:81
作者
PITTEL, B
机构
关键词
D O I
10.2307/1427240
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
引用
收藏
页码:139 / 155
页数:17
相关论文
共 15 条
[1]   A NOTE ON THE AVERAGE DEPTH OF TRIES [J].
DEVROYE, L .
COMPUTING, 1982, 28 (04) :367-371
[2]   A PROBABILISTIC ANALYSIS OF THE HEIGHT OF TRIES AND OF THE COMPLEXITY OF TRIESORT [J].
DEVROYE, L .
ACTA INFORMATICA, 1984, 21 (03) :229-237
[3]  
Fagin R., 1979, ACM Transactions on Database Systems, V4, P315, DOI 10.1145/320083.320092
[4]  
Feller W., 1970, INTRO PROBABILITY TH
[5]  
FLAJOLET P, 1982, LECT NOTES COMPUT SC, V140, P239
[6]  
Greene D.H., 1982, MATH ANAL ALGORITHMS
[7]   PROBABILITY DISTRIBUTION OF VALUES OF BINARY TREES [J].
HURWITZ, H .
COMMUNICATIONS OF THE ACM, 1971, 14 (02) :99-&
[8]  
Knuth D. E., 1973, ART COMPUTER PROGRAM
[9]  
Konheim A. G., 1973, Discrete Mathematics, V4, P57, DOI 10.1016/0012-365X(73)90114-3
[10]   ANALYSIS OF EXTENDIBLE HASHING [J].
MENDELSON, H .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1982, 8 (06) :611-619