COMPUTING ON A FREE TREE VIA COMPLEXITY-PRESERVING MAPPINGS

被引：64

作者：

CHAZELLE, B

机构：

来源：

关键词：

D O I：

10.1007/BF01840366

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：337 / 361

页数：25

共 18 条

[1]

Aho A. V., 1974, The design and analysis of computer algorithms

[2] MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J].

BENTLEY, JL .

[3]

Chazelle B., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P165, DOI 10.1109/SFCS.1985.51

[4] Fractional Cascading: I. A Data Structuring Technique [J].

Chazelle, Bernard ;

Guibas, Leonidas J. .

[5]

EDELSBRUNNER H, 1983, INT J COMPUT MATH, V13, P221, DOI 10.1080/00207168308803365

[6] FAST ALGORITHMS FOR FINDING NEAREST COMMON ANCESTORS [J].

HAREL, D ;

TARJAN, RE .

[7]

Knuth D.E., 1973, ART COMPUTER PROGRAM, V1

[8]

Komlos J., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P201, DOI 10.1109/SFCS.1984.715916

[9]

MCCREIGHT EM, 1980, CSL809 TECHN REP

[10]

MCCREIGHT EM, 1985, SIAM J COMPUT, V14, P256