Linear-space data structures for range minority query in arrays

DOI10.1007/978-3-642-31155-0_26MaRDI QIDQ2904565zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson

Publication date 14 August 2012

Published in Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31155-0_26

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Linear-space data structures for range minority query in arrays
• Linear-space data structures for range frequency queries on arrays and trees
• Linear-space data structures for range frequency queries on arrays and trees
• Range majority in constant time and linear space
• Range Majority in Constant Time and Linear Space

Cited in

(14)

• Range Majority in Constant Time and Linear Space
• Optimal encodings for range majority queries
• Linear-space data structures for range minority query in arrays
• Range majority in constant time and linear space
• Array range queries
• A linear-space data structure for range-LCP queries in poly-logarithmic time
• On hardness of several string indexing problems
• Bottom-\(k\) document retrieval
• Low space data structures for geometric range mode query
• Dynamic range majority data structures
• Linear-space data structures for range mode query in arrays
• On space efficient two dimensional range minimum data structures
• Linear-space data structures for range frequency queries on arrays and trees
• Linear-space data structures for range frequency queries on arrays and trees

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

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