ON GROWING RANDOM BINARY-TREES

被引：63

|

作者：

PITTEL, B

机构：

来源：

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS | 1984年 / 103卷 / 02期

关键词：

D O I：

10.1016/0022-247X(84)90141-0

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：461 / 480

页数：20

相关论文

共 50 条

[41] THE COMPLEXITY OF EMBEDDING GRAPHS INTO BINARY-TREES
MONIEN, B
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 300 - 309
[42] COUNTING AND RANDOMLY GENERATING BINARY-TREES
KORSH, JF
INFORMATION PROCESSING LETTERS, 1993, 45 (06) : 291 - 294
[43] EFFICIENT RETRIEVAL OF LABELED BINARY-TREES
ARGENTON, H
BECKER, P
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (11) : 1433 - 1438
[44] THE AVERAGE HEIGHT OF BINARY-TREES AND OTHER SIMPLE TREES
FLAJOLET, P
ODLYZKO, A
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 25 (02) : 171 - 213
[45] GENERATING BINARY-TREES WITH UNIFORM PROBABILITY
JOHNSEN, B
BIT, 1991, 31 (01): : 15 - 31
[46] EMBEDDING BINARY-TREES INTO CROSSED CUBES
KULASINGHE, P
BETTAYEB, S
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (07) : 923 - 929
[47] A FIBONACCI THEME ON BALANCED BINARY-TREES
HORIBE, Y
FIBONACCI QUARTERLY, 1992, 30 (03): : 244 - 250
[48] REGISTER ALLOCATION FOR UNARY BINARY-TREES
FLAJOLET, P
PRODINGER, H
SIAM JOURNAL ON COMPUTING, 1986, 15 (03) : 629 - 640
[49] EMBEDDING COMPLETE BINARY-TREES INTO HYPERCUBES
LEISS, EL
REDDY, HN
INFORMATION PROCESSING LETTERS, 1991, 38 (04) : 197 - 199
[50] PROPERTIES OF BINARY-TREES RELATED TO POSITION
SPRUGNOLI, R
COMPUTER JOURNAL, 1992, 35 (04): : 395 - 404

← 1 2 3 4 5 →