Array range queries
From MaRDI portal
Recommendations
Cites work
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Algorithm theory -- SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4--6, 2012. Proceedings
- Algorithms and Computation
- Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16--18, 2009. Proceedings
- Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5--8, 2011. Proceedings
- Approximate colored range and point enclosure queries
- Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5--12, 2009. Proceedings, Part I
- Better space bounds for parameterized range majority and minority
- Cell probe lower bounds and approximations for range mode
- Colored range queries and document retrieval
- Combinatorial pattern matching. 23rd annual symposium, CPM 2012, Helsinki, Finland, July 3--5, 2012. Proceedings
- Counting Colours in Compressed Strings
- Data structures for range median queries
- Determining the mode
- Dynamic orthogonal range queries in OLAP.
- Dynamic range majority data structures
- Dynamic range selection in linear space
- Fast Algorithms for Finding Nearest Common Ancestors
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- scientific article; zbMATH DE number 5994535 (Why is no real title available?)
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 2226802 (Why is no real title available?)
- Improved Bounds for Range Mode and Range Median Queries
- Linear-space data structures for range minority query in arrays
- Linear-space data structures for range mode query in arrays
- On Cartesian Trees and Range Minimum Queries
- On space efficient two dimensional range minimum data structures
- On the Complexity of Maintaining Partial Sums
- Online sorted range reporting
- Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums
- Optimal lower bounds for rank and select indexes
- Optimal succinctness for range minimum queries
- Orthogonal range searching in linear and almost-linear space
- Orthogonal Range Searching in Linear and Almost-Linear Space
- Path queries in weighted trees
- Range Majority in Constant Time and Linear Space
- Range majority in constant time and linear space
- Range mode and range median queries in constant time and sub-quadratic space
- Range selection and median: tight cell probe lower bounds and adaptive data structures
- Rank and select revisited and extended
- Recursive Star-Tree Parallel Data Structure
- Significant-presence range queries in categorical data.
- Sorted range reporting
- Sorting and Searching in Multisets
- Space Efficient Data Structures for Dynamic Orthogonal Range Counting
- Space-Efficient Framework for Top-k String Retrieval Problems
- STACS 2005
- Succinct Data Structures for Path Queries
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Succinct representations of weighted trees supporting path queries
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- Top-\(K\) color queries for document retrieval
- Towards an optimal space-and-query-time index for top-k document retrieval
- Towards Optimal Range Medians
- Towards optimal range medians
- Two-Dimensional Range Minimum Queries
- Wavelet trees for all
Cited in
(7)- Inverse range selection queries
- 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
- Encodings of range maximum-sum segment queries and applications
- Dynamic range majority data structures
- Optimal encodings for range top-\(k\), selection, and min-max
This page was built for publication: Array range queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848983)
