{"paper":{"title":"Lempel Ziv Computation In Small Space (LZ-CISS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Johannes Fischer, Tomohiro I","submitted_at":"2015-04-10T09:34:07Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02605","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}