On efficient unsuccessful search

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 217-227

  Hui, Lucas Chi Kwong ^a   Martel, Charles ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

MULTI-WAY SEARCHES; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; SEARCH TREES; SELF-ADJUSTING; STATIC TREES; VIRTUAL MEMORY;

TREES (MATHEMATICS);

EID: 51349087292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R. Bayer. Symmetric binary b-trees: data structure and maintenance algorithms. Acta Informactica, 1(4):290-306, 1972.
2. J. Bentley and C. McGeoch. Worst-case analysis of self-organizing sequential search heuristics. In Proceedings of 20th AUerton Conference on Communication, Control, and Computing, pages 452-461, 1983.
3. G. Frederickson. Self-organizing heuristics for implicit data structures. SIAM Journal on Computing, 13(2):277-291, 1984.
4. G. Frederickson. Implicit data structures for weighted elements. Information and Control, 66:6182, 1985.
5. L. Gotlieb. Optimal multi-way search trees. SIAM Journal on Computing, 10(3):422-433, 1981.
6. L. Hui and C. Martel. On efficient unsuccessful search. Technical Report CSE-91-6, Computer Science Division, UC Davis, 1991.
7. D. Knuth. the Art of Computer Programming. Volume 3, Addision Wesley, 1973.
8. C. Martel. Self-adjusting multi-way search trees. Information Processing Letters, 38:135-141, 1991.
9. J. McCabe. On serial files with relocatable records. Oper. Res., 12:609-618, 1965.
10. A. Moffat and O. Petersson. Historical searching and sorting. 1991. manuscript.
11. D. Naor, C. Martel, and N. Matloff. Performance of Priority Queue Structures in a Virtual Memory Environment. Technical Report GSE-88-7, Computer Science Division, UC Davis, 1988.
12. M. Sherk. Self-adjusting k-ary search trees. In Proceedings of the Workshop on Algorithms and Data Structure, pages 381-392, Springer-Verlag, 1989.
13. M. Sherk. Self-adjusting k-ary search trees and self-adjusting balanced search trees. Technical Report 234/90, University of Toronto, February 1990.
14. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Commun, of the A. CM., 28(2):202-208, 1985.
15. D. Sleator and R. Tarjan. Self-adjusting binary search trees. J.A.C.M., 32(3):652-686, 1985.