.

Publications

Most of the papers listed on this page are available in pdf format.
If the article you are interested in is not available do not esitate to contact me.
Please, note also that many of the papers on this page are subject to copyright limitations. You are free to download a copy of such publications for personal use only.

International Journals

International Conferences

Technical Reports

List of publications at DBLP

List of papers at Google Scholar

Papers at Prague Stringology Conference


2011-14 Evaluation

The ANVUR (The National Agency for the Evaluation of Universities and Research in Italy) performs a periodic evaluation of the quality of research products. Such evaluation is based on an algorithm and a set of parameters that you can find here.

Refereed International Journal Papers

[25]

Fast algorithms for single and multiple pattern Cartesian tree matching

Theoretical Computer Science, 849 (6): 47-63
By Siwoo Songa, Geonmo Gua, Cheol Ryub, Simone Faro, Thierry Lecroq and Kunsoo Park
Published in 2021
Link to publisher

[24]

Efficient Online String Matching Based on Characters Distance Text Sampling

Algorithmica 82(11): 3390-3412
By Simone Faro, Francesco Pio Marino and Arianna Pavone
Published in 2020
Link to publisher
DOI: 10.1007/s00453-020-00732-4

[23]

The order-preserving pattern matching problem in practice

Discrete Applied Mathematics 274: 11-25
By Domenico Cantone, Simone Faro and M. Oguzhan K├╝lekci
Published in 2020
Link to publisher
DOI: 10.1016/j.dam.2018.10.023

[22]

Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition

ACM Journal of Experimental Algorithmics 24(1): 1.8:1-1.8:20
By Domenico Cantone, Simone Faro and Arianna Pavone
Published in 2019
Link to publisher
DOI: 10.1145/3301295

[21]

An Efficient Skip-Search Approach to Swap Matching

Computer Journal 61(9): 1351-1360
By Simone Faro and Arianna Pavone
Published in 2018
Link to publisher
DOI: 10.1093/comjnl/bxx123

[20]

Verifiable pattern matching on outsourced texts

Journal of Discrete Algorithms 51: 39-50
By Dario Catalano, Mario Di Raimondo and Simone Faro
Published in 2018
Link to publisher
DOI: 10.1016/j.jda.2018.08.002

[19]

Engineering Order-Preserving Pattern Matching with SIMD Parallelism

Software: Practice and Experience, Vol.47(5): pp.731-739
By Chhabra Tamanna, Simone Faro and Oguzhan Kulekci
Published in 2017
Link to publisher
DOI: 10.1002/spe.2433

[18]

Text Searching Allowing for Inversions and Translocations of Factors

Discrete Applied Mathematics, Vol.163: pp.247-257
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2014
Link to publisher
DOI: 10.1016/j.dam.2013.05.016

[17]

Fast Shortest-Paths Algorithms in the Presence of few Destinations of Negative-Weight Arcs

Journal of Discrete Algorithms, Vol.24: pp.12-25
By Domenico Cantone and Simone Faro
Published in 2014
Link to publisher
DOI: 10.1016/j.jda.2013.03.005

[16]

Fast and Flexible Packed String Matching

Journal of Discrete Algorithms, Vol.28: pp.61-72
By Simone Faro and Oguzhan Kulekci
Published in 2014
Link to publisher
DOI: 10.1016/j.jda.2014.07.003

[15]

Improved and Self-Tuned Occurrence Heuristics

Journal of Discrete Algorithms, Vol.28: pp.73-84
By Domenico Cantone and Simone Faro
Published in 2014
Link to publisher
DOI: 10.1016/j.jda.2014.07.006

[14]

Efficient String-Matching Allowing for Non-Overlapping Inversions

Theoretical Computer Science, Vol.483: pp.85-95
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2013
Link to publisher
DOI: 10.1016/j.tcs.2012.06.009

[13]

The Exact Online String Matching Problem: a Review of the Most Recent Results

ACM Computing Surveys, Vol. 45(2): pages 13
By Simone Faro and Thierry Lecroq
Published in 2013
Link to publisher
DOI: 10.1145/2431211.2431212

[12]

Efficient String-Matching Allowing for Non-Overlapping Inversions

Theoretical Computer Science, Elsevier, Vol. 843: pp.85-95
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2012
Link to publisher
DOI: 10.1016/j.tcs.2012.06.009

[11]

On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns

Journal of Discrete Algorithms, Vol.11: pp.25-36
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2012
Link to publisher
DOI: 10.1016/j.jda.2011.02.001

[10]

A compact representation of nondeterministic (suffix) automata for the bit-parallel approach

Information and Computation, Vol. 213: pp. 3-12
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2012
Link to publisher
DOI: 10.1016/j.ic.2011.03.006

[9]

Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts

International Journal of Foundation of Computer Science, Vol. 23(2): pp. 343
By Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2012
Link to publisher
DOI: 10.1142/S0129054112400163

[8]

Pattern Matching with Swaps in Practice

International Journal of Foundation of Computer Science, Vol. 23(2): pp. 323
By Matteo Campanelli, Domenico Cantone, Simone Faro and Emanuele Giaquinta
Published in 2012
Link to publisher
DOI: 10.1142/S0129054112400151

[7]

String Matching with Inversions and Translocations in Linear Average Time (Most of the Time)

Information Processing Letters, Volume 111 Issue 11, May, 2011
By Szymon Grabowski, Simone Faro and Emanuele Giaquinta
Published in 2011
Link to publisher
DOI: 10.1016/j.ipl.2011.02.015

[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
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2009
Link to publisher
DOI: 10.1142/S0129054109007054

[5]

Efficient Variants of the Backward-Oracle-Matching Algorithm

International Journal of Foundation of Computer Science, Vol 20(6): pp. 967-984
By Simone Faro and Thierry Lecroq
Published in 2009
Link to publisher
DOI: 10.1142/S0129054109006991

[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
By Domenico Cantone, Salvatore Cristofaro and Simone Faro
Published in 2008
Link to publisher
DOI: 10.1142/S0129054108005565

[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
By Domenico Cantone and Simone Faro
Published in 2006
Link to publisher
DOI: 10.1142/S0129054106004388

[2]

Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm

Journal of Automata, Languages and Combinatorics, Vol. 10(5/6): pp. 589-608
By Domenico Cantone and Simone Faro
Published in 2005
Link to publisher
DOI: 10.25596/jalc-2005-589

[1]

Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm

Electronic Notes in Discrete Mathematics, Volume 17, pp.81-86
By Domenico Cantone and Simone Faro
Published in 2004
Link to publisher
DOI: 10.1016/j.endm.2004.03.019