Pages that link to "Item:Q414928"

The following pages link to Ultra-succinct representation of ordered trees with applications (Q414928):

Displaying 23 items.

• Efficient computation of Lyapunov functions for Morse decompositions (Q258397) (← links)
• Succinct dynamic cardinal trees (Q262263) (← links)
• Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← 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)
• Tree compression using string grammars (Q1742370) (← links)
• Adaptive succinctness (Q2118203) (← links)
• Improved range minimum queries (Q2397152) (← 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)
• Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number (Q2680858) (← links)
• Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
• Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
• Succinct Representations of Ordinal Trees (Q2848982) (← links)
• Encoding range minima and range top-2 queries (Q2955625) (← links)
• Compressed Multiple Pattern Matching (Q5088902) (← links)
• Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
• Generation matrix: an embeddable matrix representation for hierarchical trees (Q6057832) (← links)
• (Q6065424) (← links)