7 papers
Stability of Vortex Patches in Two Dimensional Domains
Zelin Dong
In this paper, we investigate the orbital stability of vortex patches in the two-dimensional incompressible Euler equations, extending the penalized energy variational framework pi…
Indexing Range Maximum-Sum Segment Queries with Offsets
Seungbum Jo, Dominik Köppl
Given an array of real numbers, the maximum segment sum (MSS) problem is to find a contiguous subarray that has the largest sum. While the MSS problem can be solved optimally w…
Smallest suffixient set maintenance in near-real-time
Dominik Köppl, Gregory Kucherov
The size of the \textit{smallest suffixient set} of positions of a string recently emerged as a new measure of string \textit{repetitiveness} -- a measure reflecting how much of re…
Revisiting the Sparse Matrix Compression Problem
Vincent Jugé, Dominik Köppl, Vincent Limouzy +4
The sparse matrix compression problem asks for a one-dimensional representation of a binary matrix, formed by an integer array of row indices and a shift function f…
Near-real-time Solutions for Online String Problems
Dominik Köppl, Gregory Kucherov
Based on the Breslauer-Italiano online suffix tree construction algorithm (2013) with double logarithmic worst-case guarantees on the update time per letter, we develop near-real-t…
LZD-style Compression Scheme with Truncation and Repetitions
Linus Götz, Dominik Köppl
Lempel-Ziv-Double (LZD) is a variation of the LZ78 compression scheme that achieves better compression on repetitive datasets. Nevertheless, prior research has identified computati…