Pages that link to "Item:Q2912875"
From MaRDI portal
The following pages link to Succinct Data Structures for Path Queries (Q2912875):
Displaying 11 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Tree path majority data structures (Q784481) (← links)
- Succinct data structures for nearest colored node in a tree (Q1705642) (← links)
- Path queries on functions (Q1740690) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Array Range Queries (Q2848983) (← links)
- Write it recursively (Q5178762) (← links)