Stefano Scafiti

According to our database1, Stefano Scafiti authored at least 12 papers between 2019 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the Longest Common Cartesian Substring Problem.
Comput. J., April, 2023

Compact suffix automata representations for searching long patterns.
Theor. Comput. Sci., 2023

Efficient Online String Matching through Linked Weak Factors.
CoRR, 2023

2022
A weak approach to suffix automata simulation for exact and approximate string matching.
Theor. Comput. Sci., 2022

2021
Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton.
Proceedings of the Implementation and Application of Automata, 2021

Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

The Range Automaton: An Efficient Approach to Text-Searching.
Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2020
Localizing Visitors in Natural Sites Exploiting Modality Attention on Egocentric Images and GPS Data.
Proceedings of the 15th International Joint Conference on Computer Vision, 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

Bit-Layers Text Encoding for Efficient Text Processing.
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

2019
JSCAN: Designing an Easy to use LLVM-Based Static Analysis Framework.
Proceedings of the 28th IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2019

A Potential-Based Variant of the Bellman-Ford Algorithm.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019


  Loading...