Maintaining center and median in dynamic trees
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Maintaining center and median in dynamic trees. / Alstrup, Stephen; Holm, Jacob; Thorup, Mikkel.
Algorithm Theory-SWAT 2000. Vol. 1851 Springer Science+Business Media, 2000. p. 46-56 (Lecture notes in computer science).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Alstrup, S, Holm, J & Thorup, M 2000, Maintaining center and median in dynamic trees. in Algorithm Theory-SWAT 2000. vol. 1851, Springer Science+Business Media, Lecture notes in computer science, pp. 46-56. <http://link.springer.com/content/pdf/10.1007%2F3-540-44985-X_6.pdf>
APA
Alstrup, S., Holm, J., & Thorup, M. (2000). Maintaining center and median in dynamic trees. In Algorithm Theory-SWAT 2000 (Vol. 1851, pp. 46-56). Springer Science+Business Media. Lecture notes in computer science http://link.springer.com/content/pdf/10.1007%2F3-540-44985-X_6.pdf
Vancouver
Alstrup S, Holm J, Thorup M. Maintaining center and median in dynamic trees. In Algorithm Theory-SWAT 2000. Vol. 1851. Springer Science+Business Media. 2000. p. 46-56. (Lecture notes in computer science).
Author
Bibtex
@inproceedings{eb78a59055744eeba919e80294afc534,
title = "Maintaining center and median in dynamic trees",
author = "Stephen Alstrup and Jacob Holm and Mikkel Thorup",
year = "2000",
language = "English",
volume = "1851",
series = "Lecture notes in computer science",
publisher = "Springer Science+Business Media",
pages = "46--56",
booktitle = "Algorithm Theory-SWAT 2000",
address = "Singapore",
}
RIS
TY - GEN
T1 - Maintaining center and median in dynamic trees
AU - Alstrup, Stephen
AU - Holm, Jacob
AU - Thorup, Mikkel
PY - 2000
Y1 - 2000
M3 - Article in proceedings
VL - 1851
T3 - Lecture notes in computer science
SP - 46
EP - 56
BT - Algorithm Theory-SWAT 2000
PB - Springer Science+Business Media
ER -
ID: 83456255