Range mode and range median queries on lists and trees

Authors:
Danny Krizanc;Pat Morin;Michiel Smid
Affiliations:
Wesleyan University, Mathematics Department Middletown, CT;Carleton University, School of Computer Science, Ottawa, Ontario, Canada;Carleton University, School of Computer Science, Ottawa, Ontario, Canada
Venue:
Nordic Journal of Computing
Year:
2005

Citing 11
Cited 21

New data structures for orthogonal range queries

SIAM Journal on Computing
Planar point location using persistent search trees

Communications of the ACM
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Highly parallelizable problems

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On RAM priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Incremental Context-Dependent Analysis for Language-Based Editors

ACM Transactions on Programming Languages and Systems (TOPLAS)
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Efficient applicative data types

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Space-time tradeoff for answering range queries (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Approximate range mode and range median queries

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Range Medians

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Range mode and range median queries in constant time and sub-quadratic space

Information Processing Letters
Towards Optimal Range Medians

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Range Quantile Queries: Another Virtue of Wavelet Trees

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Approximating Points by a Piecewise Linear Function: I

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Data Structures for Range Median Queries

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Improved bounds for range mode and range median queries

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Counting inversions, offline orthogonal range counting, and related problems

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Cell probe lower bounds and approximations for range mode

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Towards optimal range medians

Theoretical Computer Science
Range majority in constant time and linear space

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Range selection and median: tight cell probe lower bounds and adaptive data structures

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
New algorithms on wavelet trees and applications to information retrieval

Theoretical Computer Science
Path queries in weighted trees

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Dynamic range selection in linear space

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Linear-Space data structures for range minority query in arrays

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Succinct data structures for path queries

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Range majority in constant time and linear space

Information and Computation
Succinct representations of weighted trees supporting path queries

Journal of Discrete Algorithms
Better space bounds for parameterized range majority and minority

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Data structures for range-aggregate extent queries

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.