Showing 2026Show all
2 papers · 1 filter
cs.DS2026
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…
cs.DS2026
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…