Pages that link to "Item:Q3189085"
From MaRDI portal
The following pages link to Succinct ordinal trees based on tree covering (Q3189085):
Displaying 14 items.
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Path queries on functions (Q1740690) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Data structures for categorical path counting queries (Q2089697) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Succinct data structure for dynamic trees with faster queries (Q2420610) (← links)
- Representation of ordered trees with a given degree distribution (Q2656174) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets (Q4909570) (← links)
- (Q6065424) (← links)