Range majority in constant time and linear space

Authors:
Stephane Durocher;Meng He;J. Ian Munro;Patrick K. Nicholson;Matthew Skala
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada;Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia, Canada;Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada
Venue:
Information and Computation
Year:
2013

Citing 16
Cited 1

Functional approach to data structures and its use in multidimensional searching

SIAM Journal on Computing
Multidimensional divide-and-conquer

Communications of the ACM
High-order entropy-compressed text indexes

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
New data structures for orthogonal range searching

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An improved data stream summary: the count-min sketch and its applications

Journal of Algorithms
Range mode and range median queries on lists and trees

Nordic Journal of Computing
Dynamic ordered sets with exponential search trees

Journal of the ACM (JACM)
Determining plurality

ACM Transactions on Algorithms (TALG)
Space-efficient static trees and graphs

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Range mode and range median queries in constant time and sub-quadratic space

Information Processing Letters
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
Cell probe lower bounds and approximations for range mode

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
Approximate range mode and range median queries

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Space-Efficient and fast algorithms for multidimensional dominance reporting and counting

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Better space bounds for parameterized range majority and minority

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an array A of size n, we consider the problem of answering range majority queries: given a query range [i..j] where 1=