( en | de | ru )

 

Disambiguation of "Scafiti, Stefano"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton.

, and . CIAA, volume 12803 of Lecture Notes in Computer Science, page 165-177. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stefano Meini

Stefano Cracolici

Stefano Cardanobile

Giovanni Stefano

Stefano Carignano

 

Other publications of authors with the same name

Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings., and . ICTCS, volume 3072 of CEUR Workshop Proceedings, page 328-340. CEUR-WS.org, (2021)Bit-Layers Text Encoding for Efficient Text Processing., , and . SOFSEM (Doctoral Student Research Forum), volume 2568 of CEUR Workshop Proceedings, page 13-24. CEUR-WS.org, (2020)Efficient Online String Matching through Linked Weak Factors., , and . CoRR, (2023)A weak approach to suffix automata simulation for exact and approximate string matching., and . Theor. Comput. Sci., (2022)Localizing Visitors in Natural Sites Exploiting Modality Attention on Egocentric Images and GPS Data., , , and . VISIGRAPP (5: VISAPP), page 609-617. SCITEPRESS, (2020)JSCAN: Designing an Easy to use LLVM-Based Static Analysis Framework., , and . WETICE, page 237-242. IEEE, (2019)On the Longest Common Cartesian Substring Problem., , , and . Comput. J., 66 (4): 907-923 (April 2023)Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton., and . CIAA, volume 12803 of Lecture Notes in Computer Science, page 165-177. Springer, (2021)Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm., , and . SOFSEM (Doctoral Student Research Forum), volume 2568 of CEUR Workshop Proceedings, page 37-48. CEUR-WS.org, (2020)Compact suffix automata representations for searching long patterns., and . Theor. Comput. Sci., 940 (Part): 254-268 (2023)