The following pages link to (Q4471381):
Displayed 50 items.
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Fault tolerant depth first search in undirected graphs: simple yet efficient (Q2149103) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Practical space-efficient index for structural pattern matching (Q2169971) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- Optimal skeleton and reduced Huffman trees (Q2220839) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Block trees (Q2221797) (← links)
- Simpler FM-index for parameterized string matching (Q2224844) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Accelerated partial decoding in wavelet trees (Q2295619) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- Space-efficient fully dynamic DFS in undirected graphs (Q2312405) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform (Q2363991) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- The myriad virtues of wavelet trees (Q2389347) (← links)
- Succinct 2D dictionary matching (Q2392930) (← links)
- Parallel lightweight wavelet tree, suffix array and FM-index construction (Q2397146) (← links)
- Range selection and predecessor queries in data aware space and time (Q2397147) (← links)
- A space efficient direct access data structure (Q2397148) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel (Q2442813) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- Adaptive searching in succinctly encoded binary relations and tree-structured documents (Q2465061) (← links)
- Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
- Rank and select revisited and extended (Q2465064) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Edge minimization in de Bruijn graphs (Q2672229) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Speeding up Dynamic Programming in the Line-Constrained k-median (Q2819512) (← links)
- Locally Compressed Suffix Arrays (Q2828176) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Array Range Queries (Q2848983) (← links)
- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis (Q2942244) (← links)
- Compact Indexes for Flexible Top-$$k$$ Retrieval (Q2942258) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)