Improved Algorithms for Finding Level Ancestors in Dynamic Trees - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Stephen Alstrup, Jacob Holm. Improved Algorithms for Finding Level Ancestors in Dynamic Trees. In Ugo Montanari, José D. P. Rolim, Emo Welzl, editors, Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Volume 1853 of Lecture Notes in Computer Science, pages 73-84, Springer, 2000. [doi]

The following publications are possibly variants of this publication:

Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic TreesStephen Alstrup, Mikkel Thorup. swat 1996: 212-222

Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic TreesStephen Alstrup, Mikkel Thorup. jal, 35(2):169-188, 2000.

runs on WebDSL