32 citations · 83 across the 17 of their papers we have counts for
3 papers · 1 filter
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…
Quantum Circuits for Fixed Substring Matching Problems
Domenico Cantone, Simone Faro, Arianna Pavone +1
Quantum computation represents a computational paradigm whose distinctive attributes confer the ability to devise algorithms with asymptotic performance levels significantly superi…
The Many Qualities of a New Directly Accessible Compression Scheme
Domenico Cantone, Simone Faro
We present a new variable-length computation-friendly encoding scheme, named SFDC (Succinct Format with Direct aCcesibility), that supports direct and fast accessibility to any ele…