| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor | Boneh, Itai et al. | 2023 |
| 2 | The k-Mappability Problem Revisited | Amir, Amihood et al. | 2021 |
| 3 | Analysis of the Period Recovery Error Bound | Amir, Amihood et al. | 2020 |
| 4 | Update Query Time Trade-Off for Dynamic Suffix Arrays | Amir, Amihood et al. | 2020 |
| 5 | Repetition Detection in a Dynamic String | Amir, Amihood et al. | 2019 |
| 6 | Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms | Amir, Amihood et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |