2000 character limit reached
Lempel Ziv Computation In Small Space (LZ-CISS) (1504.02605v1)
Published 10 Apr 2015 in cs.DS
Abstract: For both the Lempel Ziv 77- and 78-factorization we propose algorithms generating the respective factorization using $(1+\epsilon) n \lg n + O(n)$ bits (for any positive constant $\epsilon \le 1$) working space (including the space for the output) for any text of size \$n\$ over an integer alphabet in $O(n / \epsilon{2})$ time.