Francesco Pio Marino

According to our database, Francesco Pio Marino authored at least 10 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Fast computation of the period and of the shortest cover of a string using its Character-Distance-Sampling representation.

Thierry Lecroq, Francesco Pio Marino

CoRR, 2024

Practical Implementation of a Quantum String Matching Algorithm.

Francesco Pio Marino, Simone Faro, Antonio Scardace

Proceedings of the 2024 Workshop on Quantum Search and Information Retrieval, 2024

Improving Sampled Matching through Character Context Sampling.

Simone Faro, Thierry Lecroq, Francesco Pio Marino, Arianna Pavone, Stefano Scafiti

Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples.

Simone Faro, Francesco Pio Marino, Antonino Andrea Moschetto, Arianna Pavone, Antonio Scardace

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023

Improved characters distance sampling for online and offline text searching.

Simone Faro, Francesco Pio Marino, Arianna Pavone

Theor. Comput. Sci., February, 2023

2021

Towards an Efficient Text Sampling Approach for Exact and Approximate Matching.

Simone Faro, Francesco Pio Marino, Arianna Pavone, Antonio Scardace

Proceedings of the Prague Stringology Conference 2021, 2021

Enhancing Characters Distance Text Sampling by Condensed Alphabets.

Simone Faro, Francesco Pio Marino, Arianna Pavone

Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

2020

Efficient Online String Matching Based on Characters Distance Text Sampling.

Simone Faro, Francesco Pio Marino, Arianna Pavone

Algorithmica, 2020

Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling.

Simone Faro, Francesco Pio Marino

Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm.

Simone Faro, Francesco Pio Marino, Stefano Scafiti

Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), 2020