Abstract

Given a positive ε≤1ε\leq 1 and read-only access to a string S[1..n]S [1..n] whose LZ77 parse consists of zz phrases, with high probability we can build an LZ77-like parse of SS that consists of $\Oh{z / ε}$ phrases using $\Oh{n^{1 + ε}}$ time, $\Oh{n^{1 + ε} / B}$ I/Os (where BB is the size of a disk block) and $\Oh{z / ε}$ space.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.