Optimal pointer algorithm for finding nearest common ancestors in dynamic trees
Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
Standard
Optimal pointer algorithm for finding nearest common ancestors in dynamic trees. / Alstrup, Stephen; Thorup, Mikkel.
Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 1097. 1996. p. 212-222.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
Harvard
Alstrup, S & Thorup, M 1996, Optimal pointer algorithm for finding nearest common ancestors in dynamic trees. in Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 1097. pp. 212-222.
APA
Alstrup, S., & Thorup, M. (1996). Optimal pointer algorithm for finding nearest common ancestors in dynamic trees. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 1097 (pp. 212-222)
Vancouver
Alstrup S, Thorup M. Optimal pointer algorithm for finding nearest common ancestors in dynamic trees. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 1097. 1996. p. 212-222
Author
Bibtex
@inbook{4d6ed3a0e24a48b4ae7b7b7d6deb9cb2,
title = "Optimal pointer algorithm for finding nearest common ancestors in dynamic trees",
author = "Stephen Alstrup and Mikkel Thorup",
note = "Covered by teArt2:Thorup00:stephen",
year = "1996",
language = "English",
pages = "212--222",
booktitle = "Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 1097",
}
RIS
TY - CHAP
T1 - Optimal pointer algorithm for finding nearest common ancestors in dynamic trees
AU - Alstrup, Stephen
AU - Thorup, Mikkel
N1 - Covered by teArt2:Thorup00:stephen
PY - 1996
Y1 - 1996
M3 - Book chapter
SP - 212
EP - 222
BT - Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 1097
ER -
ID: 98313874