@inproceedings{b54c3a2e802c44b982a255ca80c16650,

title = "Space efficient linear time lempel-ziv factorization for small alphabets",

abstract = "We present a new linear time algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length N on an alphabet of size σ, that utilizes only Nlog N + O(σ log N) bits of working space. When the alphabet size is small, this greatly improves the previous best space requirement for linear time LZ77 factorization (K{\"a}rkk{\"a}inen et al. CPM 2013), which is 2Nlog N bits, i.e. two integer arrays of length N. Experiments show that despite the added complexity of the algorithm, the speed of the algorithm is only around two to three times slower than previous fastest linear time algorithms.",

author = "Keisuke Goto and Hideo Bannai",

year = "2014",

doi = "10.1109/DCC.2014.62",

language = "English",

isbn = "9781479938827",

series = "Data Compression Conference Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "163--172",

booktitle = "Proceedings - DCC 2014",

address = "United States",

note = "2014 Data Compression Conference, DCC 2014 ; Conference date: 26-03-2014 Through 28-03-2014",

}