scientific article; zbMATH DE number 6292609
From MaRDI portal
Publication:5414581
DOI10.4086/CJTCS.2010.007zbMath1286.68531OpenAlexW4236551194MaRDI QIDQ5414581
Shunsuke Inenaga, Ayumi Shinohara, Wataru Matsubara
Publication date: 6 May 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/cjtcs.2010.007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 (2)
Linear-time text compression by longest-first substitution ⋮ An efficient algorithm to test square-freeness of strings compressed by straight-line programs
This page was built for publication:
