Optimal Succinctness for Range Minimum Queries
From MaRDI portal
Publication:3557018
DOI10.1007/978-3-642-12200-2_16zbMath1283.68141arXiv0812.2775MaRDI QIDQ3557018
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.2775
Related Items
Unnamed Item, Unnamed Item, Inducing Suffix and LCP Arrays in External Memory, Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies, Unnamed Item, Linear-space data structures for range frequency queries on arrays and trees, Colored range queries and document retrieval, On compressing and indexing repetitive sequences, Space-efficient data-analysis queries on grids, On compressing permutations and adaptive sorting, Improved algorithms for the range next value problem and applications, Improved space-time tradeoffs for approximate full-text indexing with one edit error, Efficient dynamic range minimum query, Combined data structure for previous- and next-smaller-values, On space efficient two dimensional range minimum data structures, Compact and succinct data structures for multidimensional orthogonal range searching, The range 1 query (R1Q) problem, A simple linear-space data structure for constant-time range minimum query, LRM-trees: compressed indices, adaptive sorting, and compressed permutations, Reporting and counting maximal points in a query orthogonal rectangle, Linear-space data structures for range mode query in arrays, Wavelet trees for all, On reporting the \(L_1\) metric closest pair in a query rectangle, Fully Functional Static and Dynamic Succinct Trees, From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures, Array Range Queries, Lempel Ziv Computation in Small Space (LZ-CISS), Space Efficient Data Structures for Nearest Larger Neighbor, Self-indexing Based on LZ77, LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
