LZ-End Parsing in Linear Time
From MaRDI portal
Publication:5111742
DOI10.4230/LIPICS.ESA.2017.53zbMATH Open1442.68050OpenAlexW2758331792MaRDI QIDQ5111742FDOQ5111742
Authors: Dominik Kempa, Dmitry Kosolobov 
Publication date: 27 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7847/pdf/LIPIcs-ESA-2017-53.pdf/
Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Introduction to algorithms.
- A data structure for dynamic trees
- Compressed representations of sequences and full-text indexes
- Time-space trade-offs for predecessor search
- A universal algorithm for sequential data compression
- Jewels of Stringology
- Surpassing the information theoretic bound with fusion trees
- Weighted Ancestors in Suffix Trees
- Title not available (Why is that?)
- Hybrid indexes for repetitive datasets
- Faster approximate pattern matching in compressed repetitive texts
- On compressing and indexing repetitive sequences
- Design and implementation of an efficient priority queue
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Title not available (Why is that?)
- Self-indexing based on LZ77
- Indexing text using the Ziv--Lempel trie
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
- A faster grammar-based self-index
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Range Predecessor and Lempel-Ziv Parsing
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- LZ77-Based Self-indexing with Faster Pattern Matching
- Faster Lightweight Lempel-Ziv Parsing
- LZ-End Parsing in Linear Time
- Optimal bounds for the predecessor problem
Cited In (11)
- Bidirectional Text Compression in External Memory
- Comparison of LZ77-type parsings
- A Space-Optimal Grammar Compression.
- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
- Lempel-Ziv-like parsing in small space
- On the approximation ratio of LZ-end to LZ77
- Linear-time suffix parsing for deterministic languages
- Title not available (Why is that?)
- LZ-End Parsing in Linear Time
- New advances in rightmost Lempel-Ziv
- On the number of factors in the LZ-End factorization
Uses Software
This page was built for publication: LZ-End Parsing in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111742)
