Pages that link to "Item:Q414928"
From MaRDI portal
The following pages link to Ultra-succinct representation of ordered trees with applications (Q414928):
Displaying 7 items.
- Efficient computation of Lyapunov functions for Morse decompositions (Q258397) (← links)
- Succinct dynamic cardinal trees (Q262263) (← links)
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- High-order entropy compressed bit vectors with rank/select (Q1736624) (← links)
