THE AVERAGE HEIGHT OF BINARY-TREES AND OTHER SIMPLE TREES

被引:152
作者
FLAJOLET, P [1 ]
ODLYZKO, A [1 ]
机构
[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974
关键词
D O I
10.1016/0022-0000(82)90004-6
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:171 / 213
页数:43
相关论文
共 19 条
[1]   ASYMPTOTIC METHODS IN ENUMERATION [J].
BENDER, EA .
SIAM REVIEW, 1974, 16 (04) :485-515
[2]  
de Bruijn N. G., 1972, GRAPH THEORY COMPUTI, P15
[3]  
DEBRUIJN NG, 1961, ASYMPTOTIC METHODS A
[4]  
Flajolet P., 1979, Theoretical Computer Science, V9, P99, DOI 10.1016/0304-3975(79)90009-4
[5]  
Flajolet P., 1980, 21st Annual Symposium on Foundations of Computer Science, P207, DOI 10.1109/SFCS.1980.19
[6]  
FLAJOLET P, UNPUB PERFORMANCE EV
[7]  
FLAJOLET P, 1980, 7TH P ICALP C AMST
[8]   AVERAGE NUMBER OF REGISTERS NEEDED TO EVALUATE A BINARY TREE OPTIMALLY [J].
KEMP, R .
ACTA INFORMATICA, 1979, 11 (04) :363-372
[9]  
KEMP R, 1979, 6TH P ICALP C UD
[10]  
KEMP R, 1978, A7801 SAARBR U REP