Substring Complexity in Sublinear Space
| Origin | Publisher files allowed on an open archive |
|---|
Conference Papers
Year : 2023
Marie-France Sagot : Connect in order to contact the contributor
https://inria.hal.science/hal-04385532
Submitted on : Wednesday, January 10, 2024-3:16:14 PM
Last modification on : Tuesday, November 12, 2024-4:08:03 PM
Dates and versions
Licence
Identifiers
- HAL Id : hal-04385532 , version 1
- ARXIV : 2007.08357
- DOI : 10.4230/LIPIcs.ISAAC.2023.12
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