Optimal finger search trees in the pointer machine

Journal of Computer and System Sciences

Volumn 67, Issue 2, 2003, Pages 381-418

  Brodal, Gerth Stølting ^a   Lagogiannis, George ^b,c   Makris, Christos ^b,c   Tsakalidis, Athanasios ^b,c   Tsichlas, Kostas ^b,c  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF PATRAS   (Greece)

^c Univ of Patras   (Greece)

Author keywords

Balanced search trees; Complexity; Data structures

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; SENSOR DATA FUSION; THEOREM PROVING;

BALANCED SEARCH TREEAS; FINGER SEARCH TREES; MULTIPLE SPITTING TECHNIQUES; POINTER MACHINE;

DATA STRUCTURES;

EID: 0142123171     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00013-8     Document Type: Article

References (25)

1. G.M. Adel'son-Vel'skii, E.M. Landis, An algorithm for the organization and information, Dokl. Acad. Nauk SSSR 146 263-266 (in Russian) (English Translation in Soviet Math. 3 (1962) 1259-1262.).
2. A. Anderson, M. Thorup, Tight(er) worst-case bounds on dynamic searching and priority queues, in: Proceedings of the 32nd Annual ACM Symposium On Theory of Computing (STOC), ACM, 2000, pp. 335-342.
3. M.J. Atallah, M. Goodrich, K. Ramaiyer, Biased finger trees and three-dimensional layers of maxima, in: Proceedings of the 10th ACM Symposium on Computational Geometry, 1994, pp. 150-159.
4. A.M. Ben-Amram, Pointer machines and pointer algorithms: an annotated bibliography, Technical Report D-351, Department of Computer Science, University of Copehagen (DIKU), 1998.
5. G.S. Brodal, Partially persistent data structures of bounded degree with constant update time, Nordic J. Comput. 3 (3) (1996) 238-255.
6. G.S. Brodal, Finger search trees with constant insertion time, in: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998, pp. 540-549.
7. M.J. Clancy, D.E. Knuth, A programming and problem-solving seminar, Technical Report STAN-CS-77-606, Department of Computer Science, Stanford University, 1977.
8. P. Dietz, R. Raman, A constant update time finger search tree, Inform. Process. Lett. 52 (1994) 147-154.
9. J.R. Driscoll, N. Sarnak, D.D. Sleator, R.E. Tarjan, Making data structures persistent, J. Comput. System Sci. 38 (1989) 86-124.
10. R. Fleischer, A simple balanced search tree with O(1) worst-case update time, Internat. J. Found. Comput. Sci. 7, (1996) 137-149.
11. L. Guibas, J. Hershberger, D. Leven, M. Sharir, R.E. Tarjan, Linear time algorithms for visibility and shortest path problems inside simple polygons, Algorithmica 2 (1987) 209-233.
12. L.J. Guibas, E.M. McCreight, M.P. Plass, J.R. Roberts, A new representation for linear lists, in: Proceedings of the 9th Annual ACM Symposium on Theory of Computing (STOC), ACM, 1977, pp. 49-60.
13. D. Harel, Fast updates with a guaranteed time bound per update, Technical Report 154, Dept. of ICS, University of California, Irvine, 1980.
14. D. Harel, G. Lueker, A data structure with movable fingers and deletions, Technical Report 145, Dept. of ICS, University of California, Irvine, 1979.
15. J. Hershberger, Finding the visibility graph of a simple polygon in time proportional to its size, in: Proceedings of the Third ACM Symposium on Computational Geometry, 1987, pp. 11-20.
16. K. Hoffman, K. Mehlhorn, P. Rosenstiehl, R.E. Tarjan, Sorting Jordan sequences in linear time using level-linked search trees, Inform. Control 68 (1-3) (1986) 170-184.
17. S. Huddleston, K. Mehlhorn, A new data structure for representing sorted lists, Acta Inform. 17 (1982) 157-184.
18. S.R. Kosaraju, Localized search in sorted lists, in: Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC), ACM, 1981, pp. 62-69
19. G. Lagogiannis, C. Makris, Y. Panagis, K. Tsichlas, New dynamic balanced search trees with worst-case constant update time, in: Proceedings of the 13th Australasian Workshop on Combinatorial Algorithms (AWOCA 2002), 2002.
20. C. Levcopoulos, M.H. Overmars, A balanced search tree with O(1) worst-case update time, Acta Inform. 26 (1988) 269-277.
21. K. Mehlhorn, A. Tsakalidis, Handbook of Theoretical Computer Science-Vol. I: Algorithms and Complexity, Data Structures, The MIT Press, 1990, pp. 303-341 (Chapter 6).
22. M.H. Overmars, An O(1) average time update scheme for balanced search trees, Bull. EATCS 18 (1982) 27-29.
23. R.E. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comput. System Sci. 18 (1979) 110-127.
24. R.E. Tarjan, Updating a balanced search tree in O(1) rotations, Inform. Process. Lett. 16 (1983) 253-257.
25. A.K. Tsakalidis, AVL-trees for localized search, Inform. Control 67 (1985) 173-194.