Pages that link to "Item:Q5230341"

The following pages link to At the roots of dictionary compression: string attractors (Q5230341):

Displaying 35 items.

• A compressed dynamic self-index for highly repetitive text collections (Q776840) (← links)
• Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
• Comparison of LZ77-type parsings (Q1621503) (← links)
• Universal compressed text indexing (Q1729689) (← links)
• An LMS-based grammar self-index with local consistency properties (Q2146131) (← links)
• On the approximation ratio of LZ-end to LZ77 (Q2146133) (← links)
• A separation of \(\gamma\) and \(b\) via Thue-Morse words (Q2146136) (← links)
• On stricter reachable repetitiveness measures (Q2146140) (← links)
• Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991) (← links)
• Lempel-Ziv-like parsing in small space (Q2205632) (← links)
• A combinatorial view on string attractors (Q2216440) (← links)
• Block trees (Q2221797) (← links)
• Dynamic index and LZ factorization in compressed space (Q2295634) (← links)
• LZRR: LZ77 parsing with right reference (Q2672241) (← links)
• Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
• (Q5009616) (← links)
• Bidirectional Text Compression in External Memory (Q5075783) (← links)
• Optimal rank and select queries on dictionary-compressed text (Q5088891) (← links)
• A new class of searchable and provably highly compressible string transformations (Q5088900) (← links)
• (Q5874481) (← links)
• (Q6065455) (← links)
• String attractors and infinite words (Q6109022) (← links)
• Near-optimal search time in \(\delta \)-optimal space, and vice versa (Q6130318) (← links)
• String attractors of episturmian sequences (Q6138834) (← links)
• Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)
• Random access in persistent strings and segment selection (Q6174650) (← links)
• Data structures for SMEM-finding in the PBWT (Q6545416) (← links)
• Compressibility measures for two-dimensional data (Q6545417) (← links)
• Computing all-vs-all MEMs in grammar-compressed text (Q6545422) (← links)
• Sublinear time Lempel-Ziv (LZ77) factorization (Q6545423) (← links)
• Iterated straight-line programs (Q6547917) (← links)
• Space-efficient conversions from SLPs (Q6547925) (← links)
• New string attractor-based complexities for infinite words (Q6612124) (← links)
• Linear-size suffix tries and linear-size CDAWGs simplified and improved (Q6634511) (← links)
• String attractors of some simple-parry automatic sequences (Q6661762) (← links)