HOW TO SEARCH IN HISTORY

被引：32

作者：

CHAZELLE, B

机构：

来源：

INFORMATION AND CONTROL | 1985年 / 64卷 / 1-3期

关键词：

D O I：

10.1016/S0019-9958(85)80045-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：77 / 99

页数：23

共 21 条

[1]

BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432

[2]

BENTLEY JL, 1980, J ALGORITHMS, V0001, P00301

[3]

Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P122, DOI 10.1109/SFCS.1983.17

[4]

COLE R, 1983, 88 NEW YORK U TECH R

[5]

Dobkin D., 1976, SIAM Journal on Computing, V5, P181, DOI 10.1137/0205015

[6]

Dobkin D. P., 1980, 21st Annual Symposium on Foundations of Computer Science, P200, DOI 10.1109/SFCS.1980.18

[7]

EDELSBRUNNER H, SIAM J COMPUT

[8]

Fuchs H., 1980, Computer Graphics, V14, P124, DOI 10.1145/965105.807481

[9] OPTIMAL SEARCH IN PLANAR SUBDIVISIONS [J].

KIRKPATRICK, D .

[10]

Lee D. T., 1977, SIAM Journal on Computing, V6, P594, DOI 10.1137/0206043