35 citations · 37 across the 5 of their papers we have counts for
8 papers
Mergeable Dictionaries With Shifts
Philip Bille, Mikko Berggren Etienne, Inge Li Gørtz
We revisit the mergeable dictionaries with shift problem, where the goal is to maintain a family of sets subject to search, split, merge, make-set, and shift operations. The search…
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, and ,…
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 of length using a working space as close as possible to the size of the input. Th…
Compressed Indexing with Signature Grammars
Anders Roy Christiansen, Mikko Berggren Ettienne
The compressed indexing problem is to preprocess a string of length into a compressed representation that supports pattern matching queries. That is, given a string of…
Fast Dynamic Arrays
Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne +1
We present a highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of elements supporting access in time and insertion and delet…
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing
Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz +1
Given a string , the \emph{compressed indexing problem} is to preprocess into a compressed representation that supports fast \emph{substring queries}. The goal is to use lit…
Multi-Agent Programming Contest 2012 - The Python-DTU Team
Jørgen Villadsen, Andreas Schmidt Jensen, Mikko Berggren Ettienne +3
We provide a brief description of the Python-DTU system, including the overall design, the tools and the algorithms that we plan to use in the agent contest.
Multi-Agent Programming Contest 2011 - The Python-DTU Team
Jørgen Villadsen, Mikko Berggren Ettienne, Steen Vester
We provide a brief description of the Python-DTU system, including the overall design, the tools and the algorithms that we plan to use in the agent contest.