SELF-ORGANIZING HEURISTICS FOR IMPLICIT DATA-STRUCTURES

被引：12

作者：

FREDERICKSON, GN ^{[1
]}

机构：

[1] PENN STATE UNIV, DEPT COMP SCI, UNIVERSITY PK, PA 16802 USA

来源：

关键词：

D O I：

10.1137/0213020

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：277 / 291

页数：15

共 21 条

[1] SELF-ORGANIZING BINARY SEARCH TREES [J].

ALLEN, B ;

MUNRO, I .

[2]

BAYER P, 1978, IMPROVED BOUNDS COST

[3] HEURISTICS THAT DYNAMICALLY ORGANIZE DATA-STRUCTURES [J].

BITNER, JR .

[4]

Frederickson G. N., 1981, 22nd Annual Symposium on Foundations of Computer Science, P133, DOI 10.1109/SFCS.1981.19

[5] IMPLICIT DATA-STRUCTURES FOR THE DICTIONARY PROBLEM [J].

FREDERICKSON, GN .

[6]

FREDERICKSON GN, 1982, CS8204 PENNS STAT U

[7]

FREDMAN ML, 1975, 7TH P ANN ACM S THEO, P240

[8] EXEGESIS OF SELF-ORGANIZING LINEAR SEARCH [J].

GONNET, GH ;

MUNRO, JI ;

SUWANDA, H .

[9]

GOTLIEB CC, 1972, GRAPH THEORY COMPUTI, P303

[10]

Hendricks W. J., 1976, SIAM Journal on Computing, V5, P715, DOI 10.1137/0205050