A LOWER BOUND ON THE COMPLEXITY OF ORTHOGONAL RANGE QUERIES

被引：61

作者：

FREDMAN, ML

机构：

来源：

关键词：

D O I：

10.1145/322276.322281

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：696 / 705

页数：10

共 11 条

[1]

[Anonymous], 1967, INEQUALITIES

[2]

BENTLEY JL, 1978, CMUCS78136 CARN MELL

[3]

BURKHARD W, UNPUBLISHED

[4]

FREDMAN M, UNPUBLISHED

[5] LOWER BOUNDS ON THE COMPLEXITY OF SOME OPTIMAL DATA-STRUCTURES [J].

FREDMAN, ML .

[6]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[7]

LUEKER G, 1979, 129 U CAL IRV TECH R

[8]

Lueker G. S., 1978, 19th Annual Symposium on Foundations of Computer Science, P28, DOI 10.1109/SFCS.1978.1

[9]

WILLARD D, 1978, TR2078 HARV U AIK CO

[10]

WILLARD DE, 1978, TR2278 HARV U AIK CO