DYNAMIZATION OF ORDER DECOMPOSABLE SET PROBLEMS

被引：22

作者：

OVERMARS, MH

机构：

来源：

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 1981年 / 2卷 / 03期

关键词：

D O I：

10.1016/0196-6774(81)90025-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：245 / 260

页数：16

共 22 条

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

BENTLEY, JL .

COMMUNICATIONS OF THE ACM, 1980, 23 (04) :214-229

[2] DECOMPOSABLE SEARCHING PROBLEMS [J].

BENTLEY, JL .

INFORMATION PROCESSING LETTERS, 1979, 8 (05) :244-251

[3] DIVIDE AND CONQUER FOR LINEAR EXPECTED TIME [J].

BENTLEY, JL ;

SHAMOS, MI .

INFORMATION PROCESSING LETTERS, 1978, 7 (02) :87-91

[4]

BROWN KQ, 1978, CMUCS78129 CARN MELL

[5]

BROWN KQ, 1980, CMUCS80101 CARN MELL

[6]

Kirkpatrick D. G., 1979, 20th Annual Symposium of Foundations of Computer Science, P18, DOI 10.1109/SFCS.1979.15

[7] OPTIMAL DYNAMIZATION OF DECOMPOSABLE SEARCHING PROBLEMS [J].

MEHLHORN, K ;

OVERMARS, MH .

INFORMATION PROCESSING LETTERS, 1981, 12 (02) :93-98

[8] 2 GENERAL-METHODS FOR DYNAMIZING DECOMPOSABLE SEARCHING PROBLEMS [J].

OVERMARS, MH ;

VANLEEUWEN, J .

COMPUTING, 1981, 26 (02) :155-166

[9] SOME PRINCIPLES FOR DYNAMIZING DECOMPOSABLE SEARCHING PROBLEMS [J].

OVERMARS, MH ;

VANLEEUWEN, J .

INFORMATION PROCESSING LETTERS, 1981, 12 (01) :49-53

[10]

OVERMARS MH, 1979, RUUCS799 U UTR DEP C

← 1 2 3 →