IMPLICIT DATA-STRUCTURES FOR THE DICTIONARY PROBLEM

被引:34
作者
FREDERICKSON, GN [1 ]
机构
[1] PENN STATE UNIV,UNIVERSITY PK,PA 16802
关键词
D O I
10.1145/322358.322364
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:80 / 94
页数:15
相关论文
共 15 条
[1]  
ALT H, 1981, LECTURE NOTES COMPUT, V118, P156
[2]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[3]  
BENTLEY JL, 1980, J ALGORITHMS, V0001, P00301
[4]  
COOK S, 1980, COMMUNICATION
[5]  
Frederickson G. N., 1980, 21st Annual Symposium on Foundations of Computer Science, P255, DOI 10.1109/SFCS.1980.23
[6]  
FREDERICKSON GN, 1982, CS8201 PENNS STAT U
[7]   ALGORITHMIC AND COMPLEXITY ANALYSIS OF INTERPOLATION SEARCH [J].
GONNET, GH ;
ROGERS, LD ;
GEORGE, JA .
ACTA INFORMATICA, 1980, 13 (01) :39-52
[8]  
Knuth D. E., 1973, ART COMPUTER PROGRAM
[9]   IMPLICIT DATA-STRUCTURES FOR FAST SEARCH AND UPDATE [J].
MUNRO, JI ;
SUWANDA, H .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 21 (02) :236-250
[10]  
MUNRO JI, 1979, 17TH P ALL C COMM CO, P241