关注
Julian Pape-Lange
Julian Pape-Lange
在 informatik.tu-chemnitz.de 的电子邮件经过验证
标题
引用次数
引用次数
年份
On extensions of maximal repeats in compressed strings
J Pape-Lange
arXiv preprint arXiv:2002.06265, 2020
52020
Non-rectangular convolutions and (sub-) cadences with three elements
M Funakoshi, J Pape-Lange
arXiv preprint arXiv:1910.11564, 2019
42019
On maximal repeats in compressed strings
J Pape-Lange
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
32019
Upper bounds on distinct maximal (sub-) repetitions in compressed strings
J Pape-Lange
Developments in Language Theory: 25th International Conference, DLT 2021 …, 2021
22021
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
12023
Cadences in grammar-compressed strings
J Pape-Lange
International Conference on Language and Automata Theory and Applications …, 2021
12021
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
系统目前无法执行此操作,请稍后再试。
文章 1–8