Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. / Alstrup, Stephen; Thorup, Mikkel.
In: Journal of Algorithms, Vol. 35, No. 2, 2000, p. 169-188.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
Alstrup, S & Thorup, M 2000, 'Optimal pointer algorithms for finding nearest common ancestors in dynamic trees', Journal of Algorithms, vol. 35, no. 2, pp. 169-188.
APA
Alstrup, S., & Thorup, M. (2000). Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. Journal of Algorithms, 35(2), 169-188.
Vancouver
Alstrup S, Thorup M. Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. Journal of Algorithms. 2000;35(2):169-188.
Author
Bibtex
@article{5158a53009ba44919cb5e4a87b6255a6,
title = "Optimal pointer algorithms for finding nearest common ancestors in dynamic trees",
author = "Stephen Alstrup and Mikkel Thorup",
year = "2000",
language = "English",
volume = "35",
pages = "169--188",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press",
number = "2",
}
RIS
TY - JOUR
T1 - Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
AU - Alstrup, Stephen
AU - Thorup, Mikkel
PY - 2000
Y1 - 2000
M3 - Journal article
VL - 35
SP - 169
EP - 188
JO - Journal of Algorithms
JF - Journal of Algorithms
SN - 0196-6774
IS - 2
ER -
ID: 83459428