This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, M. Fredman, and J. Komlós. Hash functions for priority queues. Information and Control, 63(3):217–225, December 1984.
Omer Berkman and Uzi Vishkin. Recursive *-tree parallel data-structure. In Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pages 196–202, October 1989.
Omer Berkman and Uzi Vishkin. Finding level-ancestors in trees. Technical Report UMIACSTR-91-9, Institute for Advanced Computer Studies, U. of Maryland, January 1991.
Michael L. Fredman and Dan E. Willard. Blasting through the information theoretic barrier with fusion trees. In Proc. 22nd ACM STOC, pages 1–7, May 1990.
Harold N. Gabow. Data structures for weighted matching and nearest common ancestor. Technical Report CU-CS-478-90, U. of Colorado at Boulder, Department of Computer Science, June 1990. An earlier version was presented at the 1990 Symp. on Discrete Algorithm.
D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. On Computing, 13(2):338–355, 1984.
Robert E. Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4):690–715, Oct. 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dietz, P.F. (1991). Finding level-ancestors in dynamic trees. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028247
Download citation
DOI: https://doi.org/10.1007/BFb0028247
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54343-5
Online ISBN: 978-3-540-47566-8
eBook Packages: Springer Book Archive