Substring Complexity in Sublinear Space - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2023

Dates and versions

hal-04385532 , version 1 (10-01-2024)

Licence

Identifiers

Cite

Giulia Bernardini, Gabriele Fici, Paweł Gawrychowski, Solon P Pissis. Substring Complexity in Sublinear Space. ISAAC 2023 - 34th International Symposium on Algorithms and Computation, Dec 2023, Kyoto, Japan. ⟨10.4230/LIPIcs.ISAAC.2023.12⟩. ⟨hal-04385532⟩
15 View
27 Download

Altmetric

Share

More