| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Lyndon Arrays in Sublinear Time | Bannai, Hideo et al. | 2023 |
| 2 | A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs | Bertram, Nico et al. | 2022 |
| 3 | Back-To-Front Online Lyndon Forest Construction | Badkobeh, Golnaz et al. | 2022 |
| 4 | Lyndon Arrays Simplified | Ellert, Jonas | 2022 |
| 5 | Linear Time Runs Over General Ordered Alphabets | Ellert, Jonas et al. | 2021 |
| 6 | Lyndon Words Accelerate Suffix Sorting | Bertram, Nico et al. | 2021 |
| 7 | Space Efficient Construction of Lyndon Arrays in Linear Time | Bille, Philip et al. | 2020 |
| 8 | Bidirectional Text Compression in External Memory | Dinklage, Patrick et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |