Pages that link to "Item:Q2784479"

The following pages link to Succinct Representation of Balanced Parentheses and Static Trees (Q2784479):

Displayed 50 items.

• Efficient computation of Lyapunov functions for Morse decompositions (Q258397) ‎ (← links)
• Succinct dynamic cardinal trees (Q262263) ‎ (← links)
• Compressed string dictionary search with edit distance one (Q270017) ‎ (← links)
• Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) ‎ (← links)
• Compressed indexes for text with wildcards (Q390873) ‎ (← links)
• On-line construction of position heaps (Q396632) ‎ (← links)
• A compact encoding of plane triangulations with efficient query supports (Q407553) ‎ (← links)
• Random generation and enumeration of bipartite permutation graphs (Q414425) ‎ (← links)
• Ultra-succinct representation of ordered trees with applications (Q414928) ‎ (← links)
• Succinct representations of permutations and functions (Q441860) ‎ (← links)
• On the approximability of some degree-constrained subgraph problems (Q444431) ‎ (← links)
• Compact navigation and distance oracles for graphs with small treewidth (Q472468) ‎ (← links)
• Succinct representation of labeled trees (Q476876) ‎ (← links)
• Simple and efficient fully-functional succinct trees (Q507389) ‎ (← links)
• Combined data structure for previous- and next-smaller-values (Q533896) ‎ (← links)
• Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) ‎ (← links)
• Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) ‎ (← links)
• On the complexity of isoperimetric problems on trees (Q765346) ‎ (← links)
• Graph compression and the zeros of polynomials (Q834888) ‎ (← links)
• A simple optimal representation for balanced parentheses (Q859854) ‎ (← links)
• Succinct data structures for flexible text retrieval systems (Q924538) ‎ (← links)
• Improved approximate string matching using compressed suffix data structures (Q930602) ‎ (← links)
• Succinct representations of planar maps (Q959810) ‎ (← links)
• On compact representations of all-pairs-shortest-path-distance matrices (Q986563) ‎ (← links)
• Compressing probability distributions (Q1045918) ‎ (← links)
• Space-efficient Euler partition and bipartite edge coloring (Q1628587) ‎ (← links)
• Path queries on functions (Q1740690) ‎ (← links)
• Tree compression using string grammars (Q1742370) ‎ (← links)
• Dynamic path queries in linear space (Q1799220) ‎ (← links)
• Flexible indexing of repetitive collections (Q2011648) ‎ (← links)
• The space complexity of sum labelling (Q2140502) ‎ (← links)
• Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) ‎ (← links)
• Block trees (Q2221797) ‎ (← links)
• Succinct representations for (non)deterministic finite automata (Q2232264) ‎ (← links)
• Lempel-Ziv compressed structures for document retrieval (Q2272976) ‎ (← links)
• Linear-time algorithms for tree root problems (Q2346968) ‎ (← links)
• Tree compression with top trees (Q2347804) ‎ (← links)
• Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) ‎ (← links)
• Succinct indices for path minimum, with applications (Q2362355) ‎ (← links)
• On succinct representations of binary trees (Q2363992) ‎ (← links)
• Succinct representations of weighted trees supporting path queries (Q2376795) ‎ (← links)
• Constructing small tree grammars and small circuits for formulas (Q2396826) ‎ (← links)
• Improved range minimum queries (Q2397152) ‎ (← links)
• Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) ‎ (← links)
• Succinct data structure for dynamic trees with faster queries (Q2420610) ‎ (← links)
• Stronger Lempel-Ziv based compressed text indexing (Q2428663) ‎ (← links)
• Succinct representation of labeled graphs (Q2428673) ‎ (← links)
• Succinct and I/O efficient data structures for traversal in trees (Q2429347) ‎ (← links)
• Adaptive searching in succinctly encoded binary relations and tree-structured documents (Q2465061) ‎ (← links)
• Truly selective polygonal mesh hierarchies with error control (Q2573867) ‎ (← links)