A Potential-Based Variant of the Bellman-Ford Algorithm. - Domenico Cantone; Pietro Maugeri; Stefano Scafiti (ICTCS, 2019)

JSCAN: Designing an Easy to use LLVM-Based Static Analysis Framework. - Andrea Fornaia; Stefano Scafiti; Emiliano Tramontana (WETICE, 2019)

Bit-Layers Text Encoding for Efficient Text Processing. - Domenico Cantone; Simone Faro; Stefano Scafiti (SOFSEM (Doctoral Student Research Forum), 2020)

Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm. - Simone Faro; Francesco Pio Marino; Stefano Scafiti (SOFSEM (Doctoral Student Research Forum), 2020)

Localizing Visitors in Natural Sites Exploiting Modality Attention on Egocentric Images and GPS Data. - Giovanni Pasqualino; Stefano Scafiti; Antonino Furnari; Giovanni Maria Farinella (VISIGRAPP (5: VISAPP), 2020)

The Range Automaton: An Efficient Approach to Text-Searching. - Simone Faro; Stefano Scafiti (WORDS, 2021)

Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings. - Simone Faro; Stefano Scafiti (ICTCS, 2021)

Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton. - Simone Faro; Stefano Scafiti (CIAA, 2021)

A weak approach to suffix automata simulation for exact and approximate string matching. - Simone Faro; Stefano Scafiti (Theor. Comput. Sci., 2022)

Efficient Online String Matching through Linked Weak Factors. - Matthew N. Palmer; Simone Faro; Stefano Scafiti (CoRR, 2023)

Compact suffix automata representations for searching long patterns. - Simone Faro; Stefano Scafiti (Theor. Comput. Sci., 2023)

On the Longest Common Cartesian Substring Problem. - Simone Faro; Thierry Lecroq; Kunsoo Park; Stefano Scafiti (Comput. J., 2023)

Improving Sampled Matching through Character Context Sampling. - Simone Faro; Thierry Lecroq; Francesco Pio Marino; Arianna Pavone; Stefano Scafiti (ICTCS, 2024)

Efficient Exact Online String Matching Through Linked Weak Factors. - Matthew N. Palmer; Simone Faro; Stefano Scafiti (SEA, 2024)