A cell probe lower bound for dynamic nearest-neighbor searching
Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
Standard
A cell probe lower bound for dynamic nearest-neighbor searching. / Alstrup, Stephen; Husfeldt, Thore; Rauhe, Theis.
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. 2001. p. 779-780.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
Harvard
Alstrup, S, Husfeldt, T & Rauhe, T 2001, A cell probe lower bound for dynamic nearest-neighbor searching. in Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. pp. 779-780.
APA
Alstrup, S., Husfeldt, T., & Rauhe, T. (2001). A cell probe lower bound for dynamic nearest-neighbor searching. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (pp. 779-780)
Vancouver
Alstrup S, Husfeldt T, Rauhe T. A cell probe lower bound for dynamic nearest-neighbor searching. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. 2001. p. 779-780
Author
Bibtex
@inbook{e6ebb5687d964681b3ddba2391540413,
title = "A cell probe lower bound for dynamic nearest-neighbor searching",
author = "Stephen Alstrup and Thore Husfeldt and Theis Rauhe",
year = "2001",
language = "English",
pages = "779--780",
booktitle = "Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms",
}
RIS
TY - CHAP
T1 - A cell probe lower bound for dynamic nearest-neighbor searching
AU - Alstrup, Stephen
AU - Husfeldt, Thore
AU - Rauhe, Theis
PY - 2001
Y1 - 2001
M3 - Book chapter
SP - 779
EP - 780
BT - Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
ER -
ID: 83462691