1 citations · 1 across the 11 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Tight Additive Sensitivity on LZ-style Compressors and String Attractors
Yuto Fujie, Hiroki Shibata, Yuto Nakashima +1
The worst-case additive sensitivity of a string repetitiveness measure is defined to be the largest difference between and , where is a string of length a…
cs.DS2025
Counting Distinct (Non-)Crossing Substrings in Optimal Time
Haruki Umezaki, Hiroki Shibata, Dominik Köppl +3
Let be a string of length . The problem of counting factors crossing a position -- Problem 64 from the textbook ``125 Problems in Text Algorithms'' [Crochemore, Lecroq, and…
cs.DS2025
LZBE: an LZ-style compressor supporting -time random access
Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi +1
An LZ-like factorization of a string divides it into factors, each being either a single character or a copy of a preceding substring. While grammar-based compression schemes suppo…