Content-dependent chunking for differential compression, the local maximum approach
From MaRDI portal
Publication:972380
DOI10.1016/j.jcss.2009.06.004zbMath1201.68015OpenAlexW1976024527MaRDI QIDQ972380
Andreas Blass, Nikolaj Bjørner, Yuri Gurevich
Publication date: 25 May 2010
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2009.06.004
Network design and communication in computer systems (68M10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compactly encoding unstructured inputs with differential compression
- Efficient randomized pattern-matching algorithms
- The Problem of Learning to Teach
- A fast algorithm for computing longest common subsequences
- Algorithms on Strings, Trees and Sequences
This page was built for publication: Content-dependent chunking for differential compression, the local maximum approach