A PATTERN-MATCHING ALGORITHM IN BINARY-TREES

被引：0
作者：
KOJIMA, K
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1983年 / 147卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：99 / 114
页数：16
相关论文
共 50 条
[41]   EMBEDDING OF BINARY-TREES INTO HYPERCUBES [J].
BIER, T ;
LOE, KF .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1989, 6 (03) :679-691
[42]   A FAMILY OF OPERATIONS ON BINARY-TREES [J].
BLONDEL, V .
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1995, 321 (04) :491-494
[43]   AN ALGORITHM TO COMPUTE THE MOBIUS FUNCTION OF THE ROTATION LATTICE OF BINARY-TREES [J].
PALLO, JM .
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1993, 27 (04) :341-348
[44]   A TREE PATTERN-MATCHING ALGORITHM WITH REASONABLE SPACE REQUIREMENTS [J].
BURGHARDT, J .
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 299 :1-15
[45]   ALGORITHMS FOR PATTERN-MATCHING [J].
DAVIES, G ;
BOWSHER, S .
SOFTWARE-PRACTICE & EXPERIENCE, 1986, 16 (06) :575-601
[46]   ADAPTIVE PATTERN-MATCHING [J].
SEKAR, RC ;
RAMESH, R ;
RAMAKRISHNAN, IV .
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 :247-260
[47]   APPROXIMATE PATTERN-MATCHING [J].
MANBER, U ;
WU, S .
BYTE, 1992, 17 (12) :281-+
[48]   ON DELETION IN THREADED BINARY-TREES [J].
BRINCK, K .
JOURNAL OF ALGORITHMS, 1986, 7 (03) :395-411
[49]   RANKING THE BEST BINARY-TREES [J].
ANILY, S ;
HASSIN, R .
SIAM JOURNAL ON COMPUTING, 1989, 18 (05) :882-892
[50]   MULTIDIMENSIONAL BALANCED BINARY-TREES [J].
VAISHNAVI, VK .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (07) :968-985
12345