On extensions of maximal repeats in compressed strings J Pape-Lange arXiv preprint arXiv:2002.06265, 2020 | 5 | 2020 |
Non-rectangular convolutions and (sub-) cadences with three elements M Funakoshi, J Pape-Lange arXiv preprint arXiv:1910.11564, 2019 | 4 | 2019 |
On maximal repeats in compressed strings J Pape-Lange 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019 | 3 | 2019 |
Upper bounds on distinct maximal (sub-) repetitions in compressed strings J Pape-Lange Developments in Language Theory: 25th International Conference, DLT 2021 …, 2021 | 2 | 2021 |
Tight upper bounds on distinct maximal (sub-) repetitions in highly compressible strings J Pape-Lange International Journal of Foundations of Computer Science 34 (02n03), 321-345, 2023 | 1 | 2023 |
Cadences in grammar-compressed strings J Pape-Lange International Conference on Language and Automata Theory and Applications …, 2021 | 1 | 2021 |
Computing (Sub-) Cadences with Three Elements by Using Polygonal Convolutions M Funakoshi, J Pape-Lange | | 2021 |
31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020) T Husfeldt, M Alzamel, A Conte, S Denzumi, R Grossi, CS Iliopoulos, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | | 2020 |