Mikko Berggren Ettienne

activity

20122019

most citedTime-Space Trade-Offs for Lempel-Ziv Compressed Indexing

35 citations · 37 across the 3 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DS2018

Compressed Communication Complexity of Longest Common Prefixes

Philip Bille, Mikko Berggreen Ettienne, Roberto Grossi +2

We consider the communication complexity of fundamental longest common prefix (Lcp) problems. In the simplest version, two parties, Alice and Bob, each hold a string, $A$ and $B$ ,…

cs.DS2018

Decompressing Lempel-Ziv Compressed Text

Philip Bille, Mikko Berggren Ettienne, Travis Gagie +2

We consider the problem of decompressing the Lempel--Ziv 77 representation of a string $S$ of length $n$ using a working space as close as possible to the size $z$ of the input. Th…