Space-efficient preprocessing schemes for range minimum queries on static arrays
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Space-efficient indexes for forbidden extension queries
- The range 1 query (R1Q) problem
- Encoding nearest larger values
- Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets
- Succinct data structures for nearest colored node in a tree
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
- Universal compressed text indexing
- The effective entropy of next/previous larger/smaller value queries
- Practical compressed suffix trees
- Finding maximal 2-dimensional palindromes
- Path queries on functions
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Alignment-free sequence comparison using absent words
- Fast compressed self-indexes with deterministic linear-time construction
- Range majorities and minorities in arrays
- Internal dictionary matching
- Range minimum queries in minimal space
- Succinct navigational oracles for families of intersection graphs on a circle
- The heaviest induced ancestors problem: better data structures and applications
- Compressed dynamic range majority and minority data structures
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
- Finding maximum sum segments in sequences with uncertainty
- Simpler FM-index for parameterized string matching
- Lempel-Ziv compressed structures for document retrieval
- Improved and extended locating functionality on compressed suffix arrays
- Compressing dictionary matching index via sparsification technique
- Succinct indices for path minimum, with applications
- On succinct representations of binary trees
- Improved range minimum queries
- Parallel construction of succinct trees
- Longest common substring with approximately \(k\) mismatches
- Document listing on repetitive collections with guaranteed performance
- Space efficient data structures for nearest larger neighbor
- Succinct encodings for families of interval graphs
- Internal shortest absent word queries in constant time and linear space
- Succinct permutation graphs
- Optimal encodings for range majority queries
- Compressed string dictionary search with edit distance one
- General document retrieval in compact space
- On (dynamic) range minimum queries in external memory
- Orthogonal range searching for text indexing
- Document retrieval with one wildcard
- Longest common extensions in trees
- Range minimum query indexes in higher dimensions
- Encodings of range maximum-sum segment queries and applications
- Encoding Nearest Larger Values
- Fast and simple computations using prefix tables under Hamming and edit distance
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Two dimensional range minimum queries and Fibonacci lattices
- Longest common extensions in trees
- Longest common prefix with mismatches
- Encoding range minima and range top-2 queries
- Hybrid indexes for repetitive datasets
- Time-optimal top-k document retrieval
- Fast circular dictionary-matching algorithm
- Longest common subsequence in at least k length order-isomorphic substrings
- I/O-efficient range minima queries
- Space-efficient frameworks for top-k string retrieval
- Searching and indexing circular patterns
- Optimal encodings for range top-\(k\), selection, and min-max
- Data structures for efficient string algorithms.
- Optimal succinctness for range minimum queries
- Online sorted range reporting
- Compressed property suffix trees
- Compact binary relation representations with rich functionality
- Entropy-bounded representation of point grids
- Multi-pattern matching with bidirectional indexes
- Practical range minimum queries revisited
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time
- String attractors: verification and optimization
- Succinct indexes for reporting discriminating and generic words
- Efficient dynamic range minimum query
- Linear-time computation of prefix table for weighted strings {\&} applications
- Conversion from RLBWT to LZ77
- Pattern discovery in colored strings
- Reverse-safe text indexing
- Dualities in tree representations
- The heaviest induced ancestors problem revisited
- A self-index on block trees
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Faster algorithms for shortest path and network flow based on graph decomposition
- Inducing suffix and LCP arrays in external memory
- Lazy Lempel-Ziv factorization algorithms
- Practical compact indexes for top-k document retrieval
- Combined data structure for previous- and next-smaller-values
- Data structures for range minimum queries in multidimensional arrays
- scientific article; zbMATH DE number 7651193 (Why is no real title available?)
- A linear-space data structure for range-LCP queries in poly-logarithmic time
- Property Suffix Array with Applications in Indexing Weighted Sequences
- Enumerating Range Modes
- Balancing run-length straight-line programs
- Data structures for computing unique palindromes in static and non-static strings
- Space-efficient data structure for next/previous larger/smaller value queries
- New variants of perfect non-crossing matchings
- Finding range minima in the middle: approximations and applications
- On longest common property preserved substring queries
- Online algorithms on antipowers and antiperiods
- On the computation of longest previous non-overlapping factors
- r-indexing the eBWT
- Data structures for SMEM-finding in the PBWT
This page was built for publication: Space-efficient preprocessing schemes for range minimum queries on static arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3020013)
