selected scholarly activity
-
conferences
- V-Words, Lyndon Words and Substring circ-UMFFs. Lecture Notes in Computer Science. 471-484. 2024
- An Overview of String Processing Applications to Data Analytics. 2021 Reconciling Data Analytics, Automation, Privacy, and Security: A Big Data Challenge (RDAAPS). 1-8. 2021
- Simple KMP Pattern-Matching on Indeterminate Strings. Proceedings of the Prague Stringology Conference 2020, PSC 2020. 125-133. 2020
- Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index. Lecture Notes in Computer Science. 329-338. 2019
- Frequency Covers for Strings. Fundamenta Informaticae. 275-289. 2018
- A faster v-order string comparison algorithm. Proceedings of the Prague Stringology Conference, PSC 2018. 38-49. 2018
- Forced Repetitions over Alphabet Lists. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2016. 125-134. 2016
- A Formal Framework for Stringology. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2015. 90-103. 2015
- Non-repetitive Strings over Alphabet Lists. Lecture Notes in Computer Science. 270-281. 2015
-
journal articles
- Practical KMP/BM style pattern-matching on indeterminate strings. Discrete Applied Mathematics. 370:22-33. 2025
- Hardening of network segmentation using automated referential penetration testing. Journal of Network and Computer Applications. 224:103851-103851. 2024
- Two formal design solutions for the generalization of network segmentation. Journal of Network and Computer Applications. 222:103763-103763. 2024
- String Covering: A Survey. Fundamenta Informaticae. 190:17-45. 2023
- Computing Maximal Covers for Protein Sequences. Journal of Computational Biology. 30:149-160. 2023
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order. Theoretical Computer Science. 880:82-96. 2021
- Longest previous overlapping factor array. Information Processing Letters. 168:106097-106097. 2021
- A Formal Approach to Network Segmentation. Computers and Security. 103:102162-102162. 2021
- A new approach to regular & indeterminate strings. Theoretical Computer Science. 854:105-115. 2021
- A formal framework for Stringology. Discrete Applied Mathematics. 274:141-151. 2020
- String covering with optimal covers. Journal of Discrete Algorithms (Amsterdam). 51:26-38. 2018
- String shuffle: Circuits and graphs. Journal of Discrete Algorithms (Amsterdam). 31:120-128. 2015
-
preprints
-
theses