Hjalte Wedel Vildhøj

activity

20112017

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

35 citations · 50 across the 10 of their papers we have counts for

collaborators

Showing 2014 · cs.DSShow all

2 papers · 2 filters

cs.DS2014

Sublinear Space Algorithms for the Longest Common Substring Problem

Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj

Given $m$ documents of total length $n$ , we consider the problem of finding a longest string common to at least $d \geq 2$ of the documents. This problem is known as the \emph{long…

cs.DS2014

A Suffix Tree Or Not A Suffix Tree?

Tatiana Starikovskaya, Hjalte Wedel Vildhøj

In this paper we study the structure of suffix trees. Given an unlabeled tree $τ$ on $n$ nodes and suffix links of its internal nodes, we ask the question "Is $τ$ a suffix tree?",…