Linear-space data structures for range mode query in arrays

DOI10.4230/LIPICS.STACS.2012.290MaRDI QIDQ2904770zbMATH OpenFDO

Authors Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson

Publication date 23 August 2012

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2012.290

zbMATH Keywords

arraydata structurelinear spacerange query

Mathematics Subject Classification ID

Data structures (68P05) Combinatorics in computer science (68R05)

Recommendations

• Linear-space data structures for range mode query in arrays
• Cell probe lower bounds and approximations for range mode
• Low space data structures for geometric range mode query
• Improved time and space bounds for dynamic range mode
• Linear-space data structures for range frequency queries on arrays and trees

Cited in

(16)

• Linear-space data structures for range mode query in arrays
• On hardness of several string indexing problems
• Low space data structures for geometric range mode query
• Linear-space data structures for range frequency queries on arrays and trees
• Optimal encodings for range majority queries
• Array range queries
• Range Majority in Constant Time and Linear Space
• Cell probe lower bounds and approximations for range mode
• Colored range queries and document retrieval
• Space-efficient data-analysis queries on grids
• Linear-space data structures for range minority query in arrays
• Improved time and space bounds for dynamic range mode
• Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
• A linear-space data structure for range-LCP queries in poly-logarithmic time
• Linear space adaptive data structures for planar range reporting
• Range mode and range median queries in constant time and sub-quadratic space

This page was built for publication: Linear-space data structures for range mode query in arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904770)