Self-organizing data structures with dependent accesses

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1099, Issue , 1996, Pages 526-537

  Schulz, Frank ^a   Schömer, Elmar ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BINARY TREES; ROBOTS;

EXPLICIT FORMULA; FIRST ORDER; MOVE-TO-FRONT SCHEMES; NEW APPROACHES; SEARCH COSTS; SEARCH TIME; SELF-ORGANIZING DATA STRUCTURES;

MARKOV CHAINS;

EID: 84947762101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_156     Document Type: Conference Paper

References (16)

1. B. Allen and I. Munro. Self-organizing binary search trees. Journal of the ACM, 25(4):526-535, 1978.
2. P. J. Burville and J. F. C Kingman. On a model for storage and search. Journal of Applied Probability, 10:697-701, 1973.
3. Ph. Chassaing. Optimality of move-to-front for self-organizing data structures with locality of references. Annals of Applied Probability, 3(4):1219-1240, 1993.
4. F. R. K. Chung, D. J. Hajela, and P. D. Seymour. Self-organizing sequential search and Hubert's inequalities. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 217-223, New York, 1985.
5. G. H. Gönnet, J. I. Munro, and H. Suwanda. Exegesis of self-organizing linear search. SI AM Journal of Computing, 10(3):613-637, 1981.
6. G. H. Gönnet, and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, 1991.
7. G. Hotz. Search tress and search graphs for markov sources. Journal of Information Processing and Cybernetics, 29:283-292, 1993.
8. Y. C. Kan and S. M. Ross. Optimal list order under partial memory constraints. Journal of Applied Probability, 17:1004-1015, 1980.
9. J. Keilson and A. Kester. Monotone matrices and monotone markov processes. Stochastic Processes and Applications, 5:231-241, 1977.
10. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Van Nostrand, Princeton, 1960.
11. J. H. B. Kemperman. The First Passage Problem for a Stationary Markov Chain. University Press, Chicago, 1961.
12. K. Lam. Comparison of self-organizing linear search. Journal of Applied Probability, 21:763-776, 1984.
13. K. Lam, Μ. Y. Leung, and M. K. Siu. Self-organizing files with dependent accesses. Journal of Applied Probability, 21:343-359, 1984.
14. R. I. Phelps and L. C. Thomas. On optimal performance in self-organizing paging algorithms. Journal Inf. Optimization Science, 1:80-93, 1980.
15. F. Schulz. Self-organizing data structures with dependent accesses. MSc Thesis supervised by Prof. Dr. G. Hotz, University of Saarbrücken, 1995 (in German). See http://hamster.cs.uni-sb.de/~schulz/
16. A. M. Tenenbaum and R. M. Nemes. Two spectra of self-organizing sequential search algorithms. SIAM Journal of Computing, 11:557-566, 1982.