The following pages link to (Q2934640):
Displaying 16 items.
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- New common ancestor problems in trees and directed acyclic graphs (Q991797) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- Adaptive searching in succinctly encoded binary relations and tree-structured documents (Q2465061) (← links)
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet (Q3010401) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- (Q3304151) (← links)
- A Uniform Approach Towards Succinct Representation of Trees (Q3512457) (← links)
- (Q5140782) (← links)
