Simone FARO

Professore associato di INFORMATICA [INF/01]
Ufficio: Studio n.366, Dipartimento di Matematica e Informatica
Email: faro@dmi.unict.it
Telefono: 095 7383053
Sito web: www.dmi.unict.it/~faro
www.facebook.com/simone.faro.9


Articoli su Riviste Internazionali

[20]An Efficient Skip-Search Approach to Swap Matching
The Computer Journal, Oxford University Press (to appear)
Autori: Simone Faro e Arianna Pavone
Pubblicato nel 2017

[19] Engineering Order-Preserving Pattern Matching with SIMD Parallelism
Software: Practice e Experience, Vol.47(5): pp.731-739
Autori: Chhabra Tamanna, Simone Faro e Oguzhan Kulekci
Pubblicato nel 2017

[18]Text Searching Allowing for Inversions e Translocations of Factors
Discrete Applied Mathematics, Vol.163: pp.247-257
Autori: Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2014

[17] Fast Shortest-Paths Algorithms in the Presence of few Destinations of Negative-Weight Arcs
Journal of Discrete Algorithms, Vol.24: pp.12-25
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2014

[16] Fast e Flexible Packed String Matching
Journal of Discrete Algorithms, Vol.28: pp.61-72
Autori: Simone Faro e Oguzhan Kulekci
Pubblicato nel 2014

[15] Improved e Self-Tuned Occurrence Heuristics
Journal of Discrete Algorithms, Vol.28: pp.73-84
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2014

[14] Efficient String-Matching Allowing for Non-Overlapping Inversions
Theoretical Computer Science, Vol.483: pp.85-95
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2013

[13] The Exact Online String Matching Problem: a Review of the Most Recent Results
ACM Computing Surveys, Vol. 45(2): pages 13
Autori: Simone Faro e Thierry Lecroq
Pubblicato nel 2013

[12] Efficient String-Matching Allowing for Non-Overlapping Inversions
Theoretical Computer Science, Elsevier, Vol. 843: pp.85-95
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2012

[11] On the bit-parallel simulation of the nondeterministic Aho-Corasick e suffix automata for a set of patterns
Journal of Discrete Algorithms, Vol.11: pp.25-36
Autori: Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2012

[10] A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Information e Computation, Vol. 213: pp. 3-12
Autori: Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2012

[9] Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts
International Journal of Foundation of Computer Science, Vol. 23(2): pp. 343
Autori: Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2012

[8] Pattern Matching with Swaps in Practice
International Journal of Foundation of Computer Science, Vol. 23(2): pp. 323
Autori: Matteo Campanelli, Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2012

[7] String Matching with Inversions e Translocations in Linear Average Time (Most of the Time)
Information Processing Letters, Volume 111 Issue 11, May, 2011
Autori: Szymon Grabowski, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2011

[6] New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps
International Journal of Foundation of Computer Science, Vol. 20(6): pp. 1087-1108
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2009

[5] Efficient Variants of the Backward-Oracle-Matching Algorithm
International Journal of Foundation of Computer Science, Vol 20(6): pp. 967-984
Autori: Simone Faro e Thierry Lecroq
Pubblicato nel 2009

[4] On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences
International Journal of Foundation of Computer Science, Vol. 19(1): pp. 103-124
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2008

[3] A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem
International Journal of Foundation of Computer Science, Vol. 17(6): pp. 1235-1252
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2006

[2] Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm
Journal of Automata, Languages e Combinatorics, Vol. 10(5/6): pp. 589-608
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2005

[1] Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm
Electronic Notes in Discrete Mathematics, Volume 17, pp.81-86
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2004


Articoli su Conferenze Internazionali

[49] Speeding Up String Matching Autori: Weak Factor Recognition
Proceedings of the Stringology Conference 2017, PSC 2016, pp.42-50
Autori: Domenico Cantone, Simone Faro e Arianna Pavone
Pubblicato nel 2017

[48] Verifiable Pattern Matching on Outsourced Texts
Proceedings of 10th International Conference on Security e Cryptography for Networks, Lecture Notes in Computer Science vol.9841, pp.333-350
Autori: Dario Catalano, Mario Di Raimondo e Simone Faro
Pubblicato nel 2016

[47] The String Matching Algorithms Research Tool
Proceedings of the Stringology Conference 2016, PSC 2016, pp.99-111
Autori: Simone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro e Alessandro Maggio
Pubblicato nel 2016

[46] A Very Fast String Matching Algorithm Based on Condensed Alphabets
Proceedings of the Eleventh International Conference on Algorithmic Aspects of Information e Management, Lecture Notes in Computer Science vol.9778, pp.65-76
Autori: Simone Faro
Pubblicato nel 2016

[45] Efficient Algorithms for the Order Preserving Pattern Matching Problem
Proceedings of the Eleventh International Conference on Algorithmic Aspects of Information e Management, Lecture Notes in Computer Science vol.9778, pp.185-196
Autori: Simone Faro e Oguzhan Kulekci
Pubblicato nel 2016

[44] Evaluation e Improvement of Fast Algorithms for Exact Matching on Genome Sequences
Proceedings of the 3rd Internanional Conference on Algorithms for Computational Biology, Lecture Notes in Computer Science vol.9702, pp.145-157
Autori: Simone Faro
Pubblicato nel 2016

[43] An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem
Proceedings of the Prague Stringology Conference 2015, PSC 2015, pp.22-35
Autori: Simone Faro, Oguzhan Kulekci e Domenico Cantone
Pubblicato nel 2015

[42] Refined Tagging of Complex Verbal Phrases for the Italian Language
Proceedings of the Prague Stringology Conference 2015, PSC 2015, pp.132-145
Autori: Simone Faro e Arianna Pavone
Pubblicato nel 2015

[41] Prior Polarity Lexical Resources for the Italian Language
Proceedings of the 12th International Workshop on Natural Language Processing e Cognitive Science, pp.106-114
Autori: V. Borzì, S. Faro, A. Pavone e S. Sansone
Pubblicato nel 2015

[40] Short Read Alignment e Compression via Shortest Unique Substring Identi ers
Proceedings of the 3rd International Work-Conference on Bioinformatics e Biomedical Engineering, LNCS Vol.9044, pp.363-374
Autori: B.Adas, E.Bayraktar, S.Faro, I.E.Moustafa e M.O.Kulekci
Pubblicato nel 2015

[39] Automatic Extraction of Semantic Relations Autori: Using Web Statistical Information
Proceedings of the International Conference on Conceptual Structures 2014 (ICCS 2014), pp.174-187
Autori: Valeria Borzì, Simone Faro e Arianna Pavone
Pubblicato nel 2014

[38] Efficient Online Abelian Pattern Matching in Strings Autori: Simulating Reactive Multi-Automata
Proceedings of the Prague Stringology Conference 2014, PSC 2014, pp.30-42
Autori: Simone Faro e Domenico Cantone
Pubblicato nel 2014

[37] Swap Matching in Strings Autori: Simulating Reactive Automata
Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp.7-20
Autori: Simone Faro
Pubblicato nel 2013

[36] Towards a Very Fast Multiple String Matching Algorithm for Short Patterns
Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp.78-91
Autori: Simone Faro e Oguzhan Kulekci
Pubblicato nel 2013

[35] Improved e Self-Tuned Occurrence Heuristics
Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp.92-106
Autori: Simone Faro e Domenico Cantone
Pubblicato nel 2013

[34] Fast Packed String Matching for Short Patterns
Proceedings of the International Meeting on Algorithm Engineering e Experiments (ALENEX13), pp.113-121
Autori: Simone Faro e Oguzhan Kulekci
Pubblicato nel 2013

[33] Fast Searching in Biological Sequences Using Multiple Hash Functions
Proceedings of the 12th IEEE International Conference on BioInformatics e BioEngineering (BIBE), pp. 175-180
Autori: Simone Faro e Thierry Lecroq
Pubblicato nel 2012

[32] Fast Multiple String Matching Using Streaming SIMD Extensions Technology
Proceedings of the 19th International Symposium on String Processing e Information Retrieval (SPIRE), Lecture Notes in Computer Science, 2012, Volume 7608, pp. 217-228
Autori: Simone Faro e Oguzhan Kulekci
Pubblicato nel 2012

[31] A Fast Suffix Automata Based Algorithm for Exact Online String Matching
Proceedings of the 17th International Conference on Implementation e Application of Automata (CIAA), Lecture Notes in Computer Science, 2012, Volume 7381, pp. 149-158
Autori: Simone Faro e Thierry Lecroq
Pubblicato nel 2012

[30] A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms
Proceedings of the 11-th International Symposium on Experimental Algorithms (SEA), Lecture Notes in Computer Science, 2012, Volume 7276/2012, pp.172-183
Autori: Simone Faro e Thierry Lecroq
Pubblicato nel 2012

[29] 2001–2010: Ten Years of Exact String Matching Algorithms
Proceedings of the Prague Stringology Conference 2011, PSC 2011, pp.1-2
Autori: Simone Faro e Thierry Lecroq
Pubblicato nel 2011

[28] Efficient Matching of Biological Sequences Allowing for Non-Overlapping Inversions
In Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, Lecture Notes in Computer Science, 2011, Volume 6661/2011, pp.364-375
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2011

[27] Approximate String Matching Allowing for Inversions e Translocations
In J.Holub e J.Zdarek (Eds.), Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp.37-51
Autori: Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2010

[26] A Space-Efficient Implementation of the Good-Suffix Heuristic
In J.Holub e J.Zdarek (Eds.), Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp.63-75
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2010

[25] A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
In Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, Lecture Notes in Computer Science, 2010, Volume 6129/2010, pp. 288-298
Autori: Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2010

[24] Bit-(Parallelism)^2: Getting to the Next Level of Parallelism
In Proceedings of the Fifth International Conference on Fun With Algorithms, FUN 2010, Lecture Notes in Computer Science, 2010, Volume 6099/2010, pp.166-177
Autori: Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2010

[23] Ant-CSP: an Ant Colony Optimization Algorithm for the Closest String Problem
In Proceedings of the 36th International Conference on Current Trends in Theory e Practice of Computer Science (SOFSEM 2010), Lecture Notes in Computer Science, Vol.5901 Springer Berlin, pp.370-381
Autori: Simone Faro e Elisa Pappalardo
Pubblicato nel 2010

[22] Efficient Pattern Matching on Binary Strings
In Proceedings of the 35th International Conference on Current Trends in Theory e Practice of Computer Science (SOFSEM 2009), January 24-30, 2009, Hotel Arnika, Spindleruv Mlyn, Czech Republic
Autori: Simone Faro e Thierry Lecroq
Pubblicato nel 2009

[21] Pattern Matching with Swaps for Short Patterns in Linear Time
In Proceedings of the 35th International Conference on Current Trends in Theory e Practice of Computer Science (SOFSEM 2009). January 24-30, 2009, Hotel Arnika, Spindleruv Mlyn, Czech Republic. Lecture Notes In Computer Science, Vol. 5404, Springer Berlin, pp.255-266
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2009

[20] A Faster Algorithm for the Single Source Shortest Path Problem in the Presence of Few Sources or Destinations of Negative Arcs
In Proceedings of the 35th International Conference on Current Trends in Theory e Practice of Computer Science (SOFSEM 2009). January 24-30, 2009, Hotel Arnika, Spindleruv Mlyn, Czech Republic
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2009

[19] An efficient matching algorithm for encoded DNA sequences e binary strings
In Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009). Lecture Notes In Computer Science, Vol. 5577, Springer-Verlag, pp.106-115
Autori: Simone Faro e Thierry Lecroq
Pubblicato nel 2009

[18] A New Algorithm for Efficient Pattern Matching with Swaps
In Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA 2009). Lecture Notes In Computer Science, Vol. 5874, Springer-Verlag, pp.230-241
Autori: Matteo Campanelli, Domenico Cantone e Simone Faro
Pubblicato nel 2009

[17] An Efficient Algorithm for Approximate Pattern Matching with Swaps
In J.Holub e J.Zdarek (Eds.), Proceedings of the 14th Prague Stringology Conference (PSC 2009), Prague, Czech Republic, pp. 90-104
Autori: Matteo Campanelli, Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2009

[16] Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts
In J.Holub e J.Zdarek (Eds.), Proceedings of the 14th Prague Stringology Conference (PSC 2009), Prague, Czech Republic, pp. 29-39
Autori: Domenico Cantone, Simone Faro e Emanuele Giaquinta
Pubblicato nel 2009

[15] Efficient Variants of the Backward-Oracle-Matching Algorithm
In J. Zdarek e J. Holub (Eds.), Proceedings of the 13th Prague Stringology Conference (PSC 2008), Prague, Czech Republic, September 2008, pp. 146-160
Autori: Simone Faro e Thierry Lecroq
Pubblicato nel 2008

[14] New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps
In J. Zdarek e J. Holub (Eds.), Proceedings of the 13th Prague Stringology Conference (PSC 2008), Prague, Czech Republic, September 2008, pp. 170-184
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2008

[13] Finite State Models for the Generation of Large Corpora of Natural Language Texts
In Proceedings of the Seventh International Workshop on Finite-State Methods e Natural Language Processing (FSMNLP 2008), Ispra, Lago Maggiore
Autori: Simone Faro, Domenico Cantone, Salvatore Cristofaro, Emanuele Giaquinta
Pubblicato nel 2008

[12] Pattern Matching for Control Chart Monitoring
In Progress in Industrial Mathematics at ECMI 2006, Mathematics in Industry, Volume 12, Springer Berlin Heidelberg, pp. 918-922
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2007

[11] On some Combinatorial Problems concerning the Harmonic Structure of Musical Chord Sequences
In M. Simanek e J. Holub (Eds.), Proc. Of the Prague Stringology Conference '06, Czech Technical University, Prague, Czech Republic
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2006

[10] An Efficient Algorithm for delta-Approximate-Matching with alpha-Bounded Gaps in Musical Sequences
In S.E. Nikoletseas (Ed.), Proc. of 4th International Workshop on Experimental e Efficient Algorithms (WEA 2005), Lecture Notes in Computer Science, Springer, Vol. 3503, pp. 428-439
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2005

[9] On Tuning The (Delta,Alpha)-Sequential-Sampling Algorithm For Delta-Approximate Matching With Alpha-Bounded Gaps In Musical Sequences
In Proceedings of 6th International Conference on Music Information Retrieval, ISMIR
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2005

[8] Solving The (Delta, Alpha)-Approximate Matching Problem Under Transposition Invariance In Musical Sequences
In Proceedings of 6th International Conference on Music Information Retrieval, ISMIR
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2005

[7] A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem
In M. Simanek e J. Holub (Eds.), Proc. Of the Prague Stringology Conference '05, Czech Technical University, Prague, Czech Republic, pp. 109-124
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2005

[6] Searching for a substring with constant extra space complexity
In P. Ferragina e R. Grossi (Eds.), Proc. Of the Third International Conference on FUN with Algorithms (FUN 2004), Edizioni Plus, University of Pisa, pp. 118-131
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2004

[5] Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm
In Proc. of Cologne-Twente Workshop on Graphs e Combinatorial Optimization (CTW 2004)
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2004

[4] Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences
In M. Simanek e J. Holub (Eds.), Proc. Of the Prague Stringology Conference '04, Czech Technical University, Prague, Czech Republic, pp. 33-47
Autori: Domenico Cantone, Salvatore Cristofaro e Simone Faro
Pubblicato nel 2004

[3] Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm
In K. Jansen, M. Margraf, M. Mastrolilli, J.D.P. Rolim (Eds.), Proc. Of Second International Workshop on Experimental Algorithms (WEA 2003), Lecture Notes in Computer Science, Springer, Vol. 2647, pp. 47-58
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2003

[2] Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm
In M. Simanek (Ed.) In Proc. of the Prague Stringology Conference '03, Czech Technical University, Prague, Czech Republic, pp. 10-24
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2003

[1] On the Frequency of Characters in Natural Language Texts
In F. Spoto, G. Scollo, e A. Nijholt (Eds.), Proc. Of Algebraic Methods in Language Processing 2003, II AMAST Workshop On Language Processing, pp. 69-82
Autori: Domenico Cantone e Simone Faro
Pubblicato nel 2003

Anno accademico  


Insegnamenti tenuti presso altri dipartimenti nell'anno accademico 2018/2019

  • DIPARTIMENTO DI SCIENZE UMANISTICHE
    Corso di laurea in Scienze e lingue per la comunicazione - 1 anno
    INFORMATICA