1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2025★ 1 cited
Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
Simone Faro, Arianna Pavone, Caterina Viola
String matching is a fundamental problem in computer science, with critical applications in text retrieval, bioinformatics, and data analysis. Among the numerous solutions that hav…
cs.DS2023
Longest Common Substring and Longest Palindromic Substring in Time
Domenico Cantone, Simone Faro, Arianna Pavone +1
The Longest Common Substring (LCS) and Longest Palindromic Substring (LPS) are classical problems in computer science, representing fundamental challenges in string processing. Bot…