Pages that link to "Item:Q2914344"
From MaRDI portal
The following pages link to Succinct Representations of Binary Trees for Range Minimum Queries (Q2914344):
Displaying 13 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- Efficient dynamic range minimum query (Q507385) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Space efficient data structures for nearest larger neighbor (Q2634717) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Space Efficient Data Structures for Nearest Larger Neighbor (Q2946053) (← links)
