Space-efficient preprocessing schemes for range minimum queries on static arrays
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Online algorithms on antipowers and antiperiods
- On the computation of longest previous non-overlapping factors
- Hybrid indexes for repetitive datasets
- Improved range minimum queries
- Path queries on functions
- A self-index on block trees
- Data structures for computing unique palindromes in static and non-static strings
- r-indexing the eBWT
- Data structures for SMEM-finding in the PBWT
- Space-time trade-offs for the LCP array of Wheeler DFAs
- Wheeler maps
- Lazy Lempel-Ziv factorization algorithms
- Optimal encodings for range top-\(k\), selection, and min-max
- Entropy-bounded representation of point grids
- Fast compressed self-indexes with deterministic linear-time construction
- Searching and indexing circular patterns
- Space efficient data structures for nearest larger neighbor
- Multi-pattern matching with bidirectional indexes
- scientific article; zbMATH DE number 7559177 (Why is no real title available?)
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Finding maximum sum segments in sequences with uncertainty
- New variants of perfect non-crossing matchings
- The effective entropy of next/previous larger/smaller value queries
- Data structures for efficient string algorithms.
- Simpler FM-index for parameterized string matching
- Succinct indices for path minimum, with applications
- Compressed string dictionary search with edit distance one
- Optimal encodings for range majority queries
- Practical compressed suffix trees
- Encoding range minima and range top-2 queries
- scientific article; zbMATH DE number 7651193 (Why is no real title available?)
- On (dynamic) range minimum queries in external memory
- Finding maximal 2-dimensional palindromes
- Fast and simple computations using prefix tables under Hamming and edit distance
- Inducing suffix and LCP arrays in external memory
- Dualities in tree representations
- Improved and extended locating functionality on compressed suffix arrays
- Longest common subsequence in at least k length order-isomorphic substrings
- Property Suffix Array with Applications in Indexing Weighted Sequences
- Document retrieval with one wildcard
- A linear-space data structure for range-LCP queries in poly-logarithmic time
- Longest common prefix with mismatches
- 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
- Compressing dictionary matching index via sparsification technique
- Lempel-Ziv factorization powered by space efficient suffix trees
- Longest common extensions in trees
- Two dimensional range minimum queries and Fibonacci lattices
- Space-efficient data structure for next/previous larger/smaller value queries
- Space-efficient indexes for forbidden extension queries
- Longest common extensions in trees
- Time-optimal top-k document retrieval
- Compressed property suffix trees
- Document listing on repetitive collections with guaranteed performance
- Generalized straight-line programs
- Practical compact indexes for top-k document retrieval
- Optimal succinctness for range minimum queries
- On space efficient two dimensional range minimum data structures
- Encoding Nearest Larger Values
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- The heaviest induced ancestors problem revisited
- Encodings of range maximum-sum segment queries and applications
- Longest common substring with approximately \(k\) mismatches
- Range minimum query indexes in higher dimensions
- Range minimum queries in minimal space
- New variants of perfect non-crossing matchings
- The heaviest induced ancestors problem: better data structures and applications
- Online sorted range reporting
- Parallel construction of succinct trees
- Internal dictionary matching
- Enumerating Range Modes
- Faster algorithms for shortest path and network flow based on graph decomposition
- Pattern discovery in colored strings
- Compact binary relation representations with rich functionality
- Quasi-linear-time algorithm for a longest common circular factor
- Encodings for range minimum queries over bounded alphabets
- The range 1 query (R1Q) problem
- Succinct encodings for families of interval graphs
- Practical range minimum queries revisited
- Reverse-safe text indexing
- Two-dimensional range successor in optimal time and almost linear space
- Lempel-Ziv compressed structures for document retrieval
- Fast circular dictionary-matching algorithm
- Orthogonal range searching for text indexing
- Space-efficient frameworks for top-k string retrieval
- Quantum data structure for range minimum query
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- scientific article; zbMATH DE number 7378722 (Why is no real title available?)
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
- A simple representation of tree covering utilizing balanced parentheses and efficient implementation of average-case optimal RMQs
- Data structures for range minimum queries in multidimensional arrays
- Internal shortest absent word queries in constant time and linear space
- Combined data structure for previous- and next-smaller-values
- General document retrieval in compact space
- Space-efficient data structure for next/previous larger/smaller value queries
- Finding range minima in the middle: approximations and applications
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time
- Range majorities and minorities in arrays
- Bat-LZ out of hell
- Exploiting new properties of string net frequency for efficient computation
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)
