Pages that link to "Item:Q692632"
From MaRDI portal
The following pages link to On space efficient two dimensional range minimum data structures (Q692632):
Displaying 18 items.
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- The effective entropy of next/previous larger/smaller value queries (Q1730022) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- Reporting and counting maximal points in a query orthogonal rectangle (Q2253906) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Space efficient data structures for nearest larger neighbor (Q2634717) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Encoding two-dimensional range top-\(k\) queries (Q2665908) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Array Range Queries (Q2848983) (← links)
- Fast String Dictionary Lookup with One Error (Q2942250) (← links)
- Range Minimum Query Indexes in Higher Dimensions (Q2942253) (← links)
- Space Efficient Data Structures for Nearest Larger Neighbor (Q2946053) (← links)
- (Q5091064) (← links)
