Pages that link to "Item:Q3020013"
From MaRDI portal
The following pages link to Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays (Q3020013):
Displaying 50 items.
- Optimal encodings for range majority queries (Q270016) (← links)
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Document retrieval with one wildcard (Q287451) (← links)
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Longest common extensions in trees (Q294947) (← links)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- Compressed property suffix trees (Q386003) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- Succinct indexes for reporting discriminating and generic words (Q501011) (← links)
- Efficient dynamic range minimum query (Q507385) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Two-dimensional range successor in optimal time and almost linear space (Q894470) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- Encoding nearest larger values (Q1698712) (← links)
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
- Succinct data structures for nearest colored node in a tree (Q1705642) (← links)
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs (Q1728316) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- The effective entropy of next/previous larger/smaller value queries (Q1730022) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← links)
- Path queries on functions (Q1740690) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Compressed dynamic range majority and minority data structures (Q2182101) (← links)
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut (Q2206728) (← links)
- Finding maximum sum segments in sequences with uncertainty (Q2216439) (← links)
- Simpler FM-index for parameterized string matching (Q2224844) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
