Francesco Pio Marino

Orcid: 0000-0003-4722-9542

According to our database1, Francesco Pio Marino authored at least 20 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Reversible Lifetime Semantics for Quantum Programs.
CoRR, March, 2026

Extending Qutes: a practical high-level language for quantum computing.
Comput. J., 2026

Optimal Character Distance Sampling for Exact String Matching Through Set Cover Reformulation.
IEEE Access, 2026

Spells for Quantum Programmers: Expressive High-Level Commands in Qutes.
Proceedings of the 13th International Conference on Fun with Algorithms, 2026

Attractor Matching: A New Paradigm for Structural String Comparison.
Proceedings of the Data Compression Conference, 2026

Enabling FM-Index for Elastic-Degenerate Strings via a New Min/Max Wavelet Tree.
Proceedings of the Data Compression Conference, 2026

A Bitwise Approach to SCER Matching in Indeterminate Strings.
Proceedings of the 37th Annual Symposium on Combinatorial Pattern Matching, 2026

2025
Scaling Grover's Search for Large Solution Spaces.
Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing, 2025

Qutes: A High-Level Quantum Programming Language for Simplified Quantum Computing.
Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing, 2025

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

Beyond Horspool: A Comparative Analysis in Sampled Matching.
Proceedings of the Prague Stringology Conference 2024, 2024

Practical Implementation of a Quantum String Matching Algorithm.
Proceedings of the 2024 Workshop on Quantum Search and Information Retrieval, 2024

Improving Sampled Matching through Character Context Sampling.
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023
Improved characters distance sampling for online and offline text searching.
Theor. Comput. Sci., February, 2023

2021
Towards an Efficient Text Sampling Approach for Exact and Approximate Matching.
Proceedings of the Prague Stringology Conference 2021, 2021

Enhancing Characters Distance Text Sampling by Condensed Alphabets.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

2020
Efficient Online String Matching Based on Characters Distance Text Sampling.
Algorithmica, 2020

Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling.
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.
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


  Loading...