Amortized rigidness in dynamic Cartesian trees

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

Volumn 3884 LNCS, Issue , 2006, Pages 80-91

  Bialynicka Birula, Iwona ^a   Grossi, Roberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; ENTROPY; MATHEMATICAL MODELS;

CARTESIAN TREES; ENTROPY-RELATED MEASURE; RIGID STRUCTURE; UNBALANCED SHAPE;

TREES (MATHEMATICS);

EID: 33745595307     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_5     Document Type: Conference Paper

References (10)

1. Vuillemin, J.: A unifying look at data structures. Comm. ACM 23 (1980) 229-239
2. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC '84. (1984) 135-143
3. Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica 16 (1996) 464-497
4. Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Latin American Theoretical Informatics '00. (2000) 88-94
5. Devroye, L.: On random Cartesian trees. Random Struct. Algorithms 5 (1994) 305-328
6. McCreight, E.M.: Priority search trees. SIAM J. Comput. 14 (1985) 257-276
7. Cole, R., Hariharan, R.: Dynamic LCA queries on trees. SIAM J. Comput. 34 (2005) 894-923
8. Edelsbrunner, H.: A new approach to rectangle intersections, part I. International Journal Computer Mathematics 13 (1983) 209-219
9. Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM J. Comput. 32 (2003) 1488-1508
10. Lagogiannis, G., Makris, C., Panagis, Y., Sioutas, S., Tsichlas, K.: New dynamic balanced search trees with worst-case constant update time. J. Autom. Lang. Comb. 8 (2003) 607-632