Range mode and range median queries on lists and trees (2003)
Cached
Download Links
- [cg.scs.carleton.ca]
- [cg.scs.carleton.ca]
- [cg.scs.carleton.ca]
- [cg.scs.carleton.ca]
- [cg.scs.carleton.ca]
- DBLP
Other Repositories/Bibliography
by
Danny Krizanc
,
Pat Morin
,
Michiel Smid
| Venue: | In Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC |
| Citations: | 11 - 2 self |
BibTeX
@INPROCEEDINGS{Krizanc03rangemode,
author = {Danny Krizanc and Pat Morin and Michiel Smid},
title = {Range mode and range median queries on lists and trees},
booktitle = {In Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC},
year = {2003},
pages = {517--526}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ABSTRACT. We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequence of labels on the path from u to v. 1
