Array Range Queries
From MaRDI portal
Publication:2848983
DOI10.1007/978-3-642-40273-9_21zbMath1394.68103OpenAlexW135380274MaRDI QIDQ2848983
Publication date: 13 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_21
Related Items
Optimal encodings for range majority queries, Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max, Dynamic range majority data structures, Encodings of Range Maximum-Sum Segment Queries and Applications, A simple linear-space data structure for constant-time range minimum query, Low space data structures for geometric range mode query, Linear-space data structures for range frequency queries on arrays and trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colored range queries and document retrieval
- Combinatorial pattern matching. 23rd annual symposium, CPM 2012, Helsinki, Finland, July 3--5, 2012. Proceedings
- Algorithm theory -- SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4--6, 2012. Proceedings
- Towards optimal range medians
- Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5--8, 2011. Proceedings
- On space efficient two dimensional range minimum data structures
- Range mode and range median queries in constant time and sub-quadratic space
- Orthogonal range searching in linear and almost-linear space
- 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
- Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16--18, 2009. Proceedings
- Determining the mode
- Dynamic orthogonal range queries in OLAP.
- A simple linear-space data structure for constant-time range minimum query
- Range majority in constant time and linear space
- Succinct representations of weighted trees supporting path queries
- Rank and select revisited and extended
- Optimal lower bounds for rank and select indexes
- Better Space Bounds for Parameterized Range Majority and Minority
- Wavelet Trees for All
- Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
- Sorted Range Reporting
- Linear-Space Data Structures for Range Minority Query in Arrays
- Succinct Data Structures for Path Queries
- Counting Colours in Compressed Strings
- Range Majority in Constant Time and Linear Space
- Path Queries in Weighted Trees
- Dynamic Range Majority Data Structures
- Dynamic Range Selection in Linear Space
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
- Fast Algorithms for Finding Nearest Common Ancestors
- Two-Dimensional Range Minimum Queries
- Optimal Succinctness for Range Minimum Queries
- Cell Probe Lower Bounds and Approximations for Range Mode
- Orthogonal Range Searching in Linear and Almost-Linear Space
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- On Cartesian Trees and Range Minimum Queries
- Towards Optimal Range Medians
- Online Sorted Range Reporting
- Data Structures for Range Median Queries
- On the Complexity of Maintaining Partial Sums
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- Recursive Star-Tree Parallel Data Structure
- Sorting and Searching in Multisets
- Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Space-Efficient Framework for Top-k String Retrieval Problems
- Algorithms and Computation
- Space Efficient Data Structures for Dynamic Orthogonal Range Counting
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Improved Bounds for Range Mode and Range Median Queries
- STACS 2005
- Algorithms and Data Structures
