Range Predecessor and Lempel-Ziv Parsing

DOI10.1137/1.9781611974331.ch143zbMath1410.68116arXiv1507.07080OpenAlexW2241126083MaRDI QIDQ4575728

Simon J. Puglisi, Djamal Belazzougui

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.07080

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Related Items (15)

Unnamed Item ⋮ Range selection and predecessor queries in data aware space and time ⋮ Unnamed Item ⋮ On optimal parsing for LZ78-like compressors ⋮ Lempel-Ziv-like parsing in small space ⋮ Universal compressed text indexing ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries ⋮ LZ77 computation based on the run-length encoded BWT ⋮ Lempel-Ziv factorization powered by space efficient suffix trees ⋮ Dynamic index and LZ factorization in compressed space ⋮ Refining the \(r\)-index ⋮ Computing runs on a trie ⋮ Space-efficient fully dynamic DFS in undirected graphs ⋮ LZ-End Parsing in Linear Time ⋮ Fully Dynamic Connectivity Oracles under General Vertex Updates

This page was built for publication: Range Predecessor and Lempel-Ziv Parsing