The following pages link to (Q4875211):
Displaying 48 items.
- Compressed property suffix trees (Q386003) (← links)
- On-line construction of position heaps (Q396632) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Succinct representation of dynamic trees (Q541673) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- The power and limitations of static binary search trees with lazy finger (Q727988) (← links)
- A simple optimal representation for balanced parentheses (Q859854) (← links)
- Two-dimensional range successor in optimal time and almost linear space (Q894470) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- Geometric inhomogeneous random graphs (Q1713405) (← links)
- Approximate query processing over static sets and sliding windows (Q1981762) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Adaptive succinctness (Q2118203) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- How to pack directed acyclic graphs into small blocks (Q2208351) (← links)
- Reporting and counting maximal points in a query orthogonal rectangle (Q2253906) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- Worst-case optimal tree layout in external memory (Q2354018) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- Parallel construction of succinct trees (Q2410360) (← 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)
- 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)
- Distributed suffix trees (Q2569396) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number (Q2680858) (← links)
- Locally Compressed Suffix Arrays (Q2828176) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- On the Weak Prefix-Search Problem (Q3011860) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- A Uniform Approach Towards Succinct Representation of Trees (Q3512457) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- (Q5091046) (← links)
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time (Q5111706) (← links)
- (Q6065424) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q6536270) (← links)
- Adaptive succinctness (Q6536273) (← links)
