Pages that link to "Item:Q3557018"
From MaRDI portal
The following pages link to Optimal Succinctness for Range Minimum Queries (Q3557018):
Displayed 17 items.
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- Reporting and counting maximal points in a query orthogonal rectangle (Q2253906) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Wavelet trees for all (Q2442812) (← links)
- On reporting the \(L_1\) metric closest pair in a query rectangle (Q2446069) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Array Range Queries (Q2848983) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)