Dynamic and Internal Longest Common Substring A Amir, P Charalampopoulos, SP Pissis, J Radoszewski
Algorithmica 82 (12), 3707-3743, 2020
58 * 2020 Faster approximate pattern matching: A unified approach P Charalampopoulos, T Kociumaka, P Wellnitz
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
48 2020 Alignment-free sequence comparison using absent words P Charalampopoulos, M Crochemore, G Fici, R Mercaş, SP Pissis
Information and Computation 262, 57-68, 2018
38 2018 On avoided words, absent words, and their application to biological sequence analysis Y Almirantis, P Charalampopoulos, J Gao, CS Iliopoulos, M Mohamed, ...
Algorithms for Molecular Biology 12, 1-12, 2017
37 2017 Almost optimal distance oracles for planar graphs P Charalampopoulos, P Gawrychowski, S Mozes, O Weimann
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
35 2019 Linear-Time Algorithm for Long LCF with P Charalampopoulos, M Crochemore, CS Iliopoulos, T Kociumaka, ...
arXiv preprint arXiv:1802.06369, 2018
27 2018 Faster Algorithms for Longest Common Substring P Charalampopoulos, T Kociumaka, SP Pissis, J Radoszewski
arXiv preprint arXiv:2105.03106, 2021
26 2021 Longest Common Factor After One Edit Operation A Amir, P Charalampopoulos, CS Iliopoulos, SP Pissis, J Radoszewski
International Symposium on String Processing and Information Retrieval, 14-26, 2017
26 2017 Repetition Detection in a Dynamic String A Amir, I Boneh, P Charalampopoulos, E Kondratovsky
27th Annual European Symposium on Algorithms (ESA 2019), 2019
25 2019 Dynamic Longest Common Substring in Polylogarithmic Time P Charalampopoulos, P Gawrychowski, K Pokorski
arXiv preprint arXiv:2006.02408, 2020
24 2020 Dynamic String Alignment P Charalampopoulos, T Kociumaka, S Mozes
31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020
24 2020 Property suffix array with applications in indexing weighted sequences P Charalampopoulos, CS Iliopoulos, C Liu, SP Pissis
Journal of Experimental Algorithmics (JEA) 25, 1-16, 2020
23 * 2020 Exact distance oracles for planar graphs with failing vertices P Charalampopoulos, S Mozes, B Tebeka
ACM Transactions on Algorithms (TALG) 18 (2), 1-23, 2022
20 2022 Internal dictionary matching P Charalampopoulos, T Kociumaka, M Mohamed, J Radoszewski, ...
Algorithmica 83 (7), 2142-2169, 2021
20 2021 Longest Common Prefixes with k -Errors and Applications LAK Ayad, C Barton, P Charalampopoulos, CS Iliopoulos, SP Pissis
International Symposium on String Processing and Information Retrieval, 27-41, 2018
20 2018 On Extended Special Factors of a Word P Charalampopoulos, M Crochemore, SP Pissis
International Symposium on String Processing and Information Retrieval, 131-138, 2018
19 2018 The Number of Repetitions in 2D-Strings P Charalampopoulos, J Radoszewski, W Rytter, T Waleń, W Zuba
arXiv preprint arXiv:2006.15999, 2020
15 2020 Internal shortest absent word queries in constant time and linear space G Badkobeh, P Charalampopoulos, D Kosolobov, SP Pissis
Theoretical Computer Science 922, 271-282, 2022
13 * 2022 An Almost Optimal Edit Distance Oracle P Charalampopoulos, P Gawrychowski, S Mozes, O Weimann
arXiv preprint arXiv:2103.03294, 2021
13 2021 Circular pattern matching with k mismatches P Charalampopoulos, T Kociumaka, SP Pissis, J Radoszewski, W Rytter, ...
Journal of Computer and System Sciences, 2020
13 2020 
Jakub RadoszewskiUniversity of Warsawmimuw.edu.pl의 이메일 확인됨
