Recursive star-tree parallel data structure
SIAM Journal on Computing
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
A unifying look at data structures
Communications of the ACM
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
New text indexing functionalities of the compressed suffix arrays
Journal of Algorithms
Representing Trees of Higher Degree
Algorithmica
A simple optimal representation for balanced parentheses
Theoretical Computer Science
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Ultra-succinct representation of ordered trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal lower bounds for rank and select indexes
Theoretical Computer Science
Compressed Suffix Trees with Full Functionality
Theory of Computing Systems
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
DCC '08 Proceedings of the Data Compression Conference
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Faster entropy-bounded compressed suffix trees
Theoretical Computer Science
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Amortized rigidness in dynamic cartesian trees
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Data structures: time, I/Os, entropy, joules!
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
On space efficient two dimensional range minimum data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Colored range queries and document retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Note: Combined data structure for previous- and next-smaller-values
Theoretical Computer Science
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Improved compressed indexes for full-text document retrieval
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
Top-k document retrieval in optimal time and linear space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Space-efficient data-analysis queries on grids
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Improved algorithms for the range next value problem and applications
Theoretical Computer Science
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Towards an optimal space-and-query-time index for top-k document retrieval
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
Theoretical Computer Science
Improved compressed indexes for full-text document retrieval
Journal of Discrete Algorithms
On compressing and indexing repetitive sequences
Theoretical Computer Science
Colored range queries and document retrieval
Theoretical Computer Science
Space-efficient data-analysis queries on grids
Theoretical Computer Science
Better space bounds for parameterized range majority and minority
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
On compressing permutations and adaptive sorting
Theoretical Computer Science
On reporting the L1 metric closest pair in a query rectangle
Information Processing Letters
Journal of Discrete Algorithms
| Hi-index | 0.01 |
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into a scheme of size 2n+o(n) bits that allows to answer range minimum queries on A in constant time. This space is asymptotically optimal in the important setting where access to A is not permitted after the preprocessing step. Our scheme can be computed in linear time, using only n+o(n) additional bits for construction. We also improve on LCA-computation in BPS- or DFUDS-encoded trees.