Efficient Online String Matching Based on Characters Distance Text Sampling S Faro, FP Marino, A Pavone Algorithmica, 1-23, 2020 | 11 | 2020 |
Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling. S Faro, FP Marino Stringology, 148-159, 2020 | 5 | 2020 |
Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm S Faro, FP Marino, S Scafiti SOFSEM (Doctoral Student Research Forum), 2020, 2020 | 4 | 2020 |
Enhancing Characters Distance Text Sampling by Condensed Alphabets S Faro, FP Marino, A Pavone | 3 | 2021 |
Improved characters distance sampling for online and offline text searching S Faro, FP Marino, A Pavone Theoretical Computer Science 946, 113684, 2023 | 2 | 2023 |
Towards an Efficient Text Sampling Approach for Exact and Approximate Matching S Faro, FP Marino, A Pavone, A Scardace Prague Stringology Conference 2021, 75, 2021 | 2 | 2021 |
The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples S Faro, FP Marino, A Moschetto, A Pavone, A Scardace 12th International Conference on Fun with Algorithms (FUN 2024), 2024 | 1 | 2024 |
Fast computation of the period and of the shortest cover of a string using its Character-Distance-Sampling representation T Lecroq, FP Marino arXiv preprint arXiv:2407.18216, 2024 | | 2024 |
Practical Implementation of a Quantum String Matching Algorithm FP Marino, S Faro, A Scardace Proceedings of the 2024 Workshop on Quantum Search and Information Retrieval …, 2024 | | 2024 |
Character Distance Text Sampling in the case of Small Alphabets FP Marino | | |