Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. / Alstrup, Stephen; Thorup, Mikkel.
Algorithm Theory—SWAT'96. Springer Science+Business Media, 1996. p. 212-222 (Lecture notes in computer science, Vol. 1097).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Alstrup, S & Thorup, M 1996, Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. in Algorithm Theory—SWAT'96. Springer Science+Business Media, Lecture notes in computer science, vol. 1097, pp. 212-222.
APA
Alstrup, S., & Thorup, M. (1996). Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. In Algorithm Theory—SWAT'96 (pp. 212-222). Springer Science+Business Media. Lecture notes in computer science Vol. 1097
Vancouver
Alstrup S, Thorup M. Optimal pointer algorithms for finding nearest common ancestors in dynamic trees. In Algorithm Theory—SWAT'96. Springer Science+Business Media. 1996. p. 212-222. (Lecture notes in computer science, Vol. 1097).
Author
Bibtex
@inproceedings{da387912b7cd4700a80682104b034af8,
title = "Optimal pointer algorithms for finding nearest common ancestors in dynamic trees",
author = "Stephen Alstrup and Mikkel Thorup",
year = "1996",
language = "English",
series = "Lecture notes in computer science",
publisher = "Springer Science+Business Media",
pages = "212--222",
booktitle = "Algorithm Theory—SWAT'96",
address = "Singapore",
}
RIS
TY - GEN
T1 - Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
AU - Alstrup, Stephen
AU - Thorup, Mikkel
PY - 1996
Y1 - 1996
M3 - Article in proceedings
T3 - Lecture notes in computer science
SP - 212
EP - 222
BT - Algorithm Theory—SWAT'96
PB - Springer Science+Business Media
ER -
ID: 84717026