2 papers
cs.DS2023
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata
Sung-Hwan Kim, Francisco Olivares, Nicola Prezza
Sorting is a fundamental algorithmic pre-processing technique which often allows to represent data more compactly and, at the same time, speeds up search queries on it. In this pap…
cs.DS2022
Balancing Run-Length Straight-Line Programs*
Gonzalo Navarro, Francisco Olivares, Cristian Urbina
It was recently proved that any SLP generating a given string can be transformed in linear time into an equivalent balanced SLP of the same asymptotic size. We show that this r…