A NEW DATA STRUCTURE FOR REPRESENTING SORTED LISTS

被引:107
作者
HUDDLESTON, S [1 ]
MEHLHORN, K [1 ]
机构
[1] UNIV SAARLAND,FACHBEREICH INFORMAT 10,D-6600 SAARBRUCKEN,FED REP GER
关键词
D O I
10.1007/BF00288968
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:157 / 184
页数:28
相关论文
共 13 条
[1]  
Bayer R., 1972, Acta Informatica, V1, P290, DOI 10.1007/BF00289509
[2]  
BAYER R, 1977, ACTA INFORM, V9, P1
[3]  
BAYER R., 1972, ACTA INFORM, V1, P173, DOI [DOI 10.1007/BF00288683, 10.1007/BF00288683]
[4]   ON THE AVERAGE NUMBER OF REBALANCING OPERATIONS IN WEIGHT-BALANCED TREES [J].
BLUM, N ;
MEHLHORN, K .
THEORETICAL COMPUTER SCIENCE, 1980, 11 (03) :303-320
[5]   DESIGN AND ANALYSIS OF A DATA STRUCTURE FOR REPRESENTING SORTED LISTS [J].
BROWN, MR ;
TARJAN, RE .
SIAM JOURNAL ON COMPUTING, 1980, 9 (03) :594-614
[6]  
Guibas L.J., 1978, 19TH P ANN IEEE S F, P8
[7]  
Guibas Leo J., 1977, NEW REPRESENTATION L, P49, DOI [10.1145/800105.803395, DOI 10.1145/800105.803395]
[8]  
HUDDLESTON S, 1981, 5TH GI C THEOR INF K, V104, P234
[9]  
HUDDLESTON S, 1981, THESIS U WASHINGTON
[10]  
MAIER D, 1979, 79007 STAT U NEW YOR