# Range mode query

Known as: Range mode queries
In data structures, the range mode query problem asks to build a data structure on some input data to efficiently answer queries asking for the mode…
Wikipedia (opens in a new tab)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
• International Symposium on Algorithms and…
• 2019
• Corpus ID: 197935219
For any $\epsilon \in (0,1)$, a $(1+\epsilon)$-approximate range mode query asks for the position of an element whose frequency…
2019
2018
2018
In this thesis we study space-efficient data structures for various combinatorial objects. We focus on succinct and compact data…
2015
2015
• Canadian Conference on Computational Geometry
• 2015
• Corpus ID: 397094
2011
2011
• Theory of Computing Systems
• 2011
• Corpus ID: 3052753
A mode of a multiset S is an element a∈S of maximum multiplicity; that is, a occurs at least as frequently as any other element…
2010
2010
• International Colloquium on Automata, Languages…
• 2010
• Corpus ID: 17927743
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode…
2005
2005
• Symposium on Theoretical Aspects of Computer…
• 2005
• Corpus ID: 13523199
We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j…