Pages that link to "Item:Q3581537"
From MaRDI portal
The following pages link to Rank/select operations on large alphabets (Q3581537):
Displaying 48 items.
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Cross-document pattern matching (Q396714) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- Position-restricted substring searching over small alphabets (Q1679612) (← links)
- siEDM: an efficient string index and search algorithm for edit distance with moves (Q1736784) (← links)
- Ranked document retrieval for multiple patterns (Q1784746) (← links)
- Approximate query processing over static sets and sliding windows (Q1981762) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- Adaptive searching in succinctly encoded binary relations and tree-structured documents (Q2465061) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number (Q2680858) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- (Q3304151) (← links)
- Access, Rank, and Select in Grammar-compressed Strings (Q3452777) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
- (Q5091046) (← links)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- (Q6065455) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- A practical alphabet-partitioning rank/select data structure (Q6536272) (← links)
