Gabriele Fici

According to our database, Gabriele Fici authored at least 77 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Abelian combinatorics on words: A survey.

Gabriele Fici, Svetlana Puzynina

Comput. Sci. Rev., February, 2023

Substring Complexity in Sublinear Space.

Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

On the Impact of Morphisms on BWT-Runs.

Gabriele Fici, Giuseppe Romana, Marinella Sciortino, Cristian Urbina

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

On the Lie complexity of Sturmian words.

Alessandro De Luca, Gabriele Fici

Theor. Comput. Sci., 2022

Properties of a class of Toeplitz words.

Gabriele Fici, Jeffrey O. Shallit

Theor. Comput. Sci., 2022

Some Results on Digital Segments and Balanced Words.

Alessandro De Luca, Gabriele Fici

CoRR, 2022

Maximal Closed Substrings.

Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici, Simon J. Puglisi

Proceedings of the String Processing and Information Retrieval, 2022

2021

Adaptive learning of compressible strings.

Gabriele Fici, Nicola Prezza, Rossano Venturini

Theor. Comput. Sci., 2021

Primitive sets of words.

Giuseppa Castiglione, Gabriele Fici, Antonio Restivo

Theor. Comput. Sci., 2021

Constructing Antidictionaries of Long Texts in Output-Sensitive Space.

Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis

Theory Comput. Syst., 2021

Reverse-Safe Text Indexing.

Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis

ACM J. Exp. Algorithmics, 2021

2020

Preface.

Gabriele Fici, Giuseppe F. Italiano

Theor. Comput. Sci., 2020

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word.

Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada

Theor. Comput. Sci., 2020

Substring Query Complexity of String Reconstruction.

Gabriele Fici, Nicola Prezza, Rossano Venturini

CoRR, 2020

Reverse-Safe Data Structures for Text Indexing.

Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Minimal forbidden factors of circular words.

Gabriele Fici, Antonio Restivo, Laura Rizzo

Theor. Comput. Sci., 2019

Aldo de Luca (1941 - 2018).

Clelia De Felice, Gabriele Fici, Antonio Restivo

Bull. EATCS, 2019

Abelian antipowers in infinite words.

Gabriele Fici, Mickaël Postic, Manuel Silva

Adv. Appl. Math., 2019

Minimal Absent Words in Rooted and Unrooted Trees.

Gabriele Fici, Pawel Gawrychowski

Proceedings of the String Processing and Information Retrieval, 2019

Constructing Antidictionaries in Output-Sensitive Space.

Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis

Proceedings of the Data Compression Conference, 2019

On Sets of Words of Rank Two.

Giuseppa Castiglione, Gabriele Fici, Antonio Restivo

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

Anti-powers in infinite words.

Gabriele Fici, Antonio Restivo, Manuel Silva, Luca Q. Zamboni

J. Comb. Theory, Ser. A, 2018

Algorithms for anti-powers in strings.

Golnaz Badkobeh, Gabriele Fici, Simon J. Puglisi

Inf. Process. Lett., 2018

Alignment-free sequence comparison using absent words.

Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis

Inf. Comput., 2018

Abelian Anti-Powers in Infinite Words.

Gabriele Fici, Mickaël Postic, Manuel Silva

CoRR, 2018

On k-Maximal Submonoids, with Applications in Combinatorics on Words.

Giuseppa Castiglione, Gabriele Fici, Antonio Restivo

CoRR, 2018

2017

Abelian-square-rich words.

Gabriele Fici, Filippo Mignosi, Jeffrey O. Shallit

Theor. Comput. Sci., 2017

On prefix normal words and prefix normal forms.

Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada

Theor. Comput. Sci., 2017

Cyclic complexity of words.

Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni

J. Comb. Theory, Ser. A, 2017

Open and ClosedWords.

Gabriele Fici

Bull. EATCS, 2017

The sequence of open and closed prefixes of a Sturmian word.

Alessandro De Luca, Gabriele Fici, Luca Q. Zamboni

Adv. Appl. Math., 2017

2016

Abelian powers and repetitions in Sturmian words.

Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Jarkko Peltomäki, Élise Prieur-Gaston

Theor. Comput. Sci., 2016

Fast computation of abelian runs.

Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston

Theor. Comput. Sci., 2016

On the greedy algorithm for the Shortest Common Superstring problem with reversals.

Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen

Inf. Process. Lett., 2016

A note on easy and efficient computation of full abelian periods of a word.

Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth

Discret. Appl. Math., 2016

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.

Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Vertical representation of C^∞-words.

Jean-Marc Fedou, Gabriele Fici

Theor. Comput. Sci., 2015

Factorizations of the Fibonacci Infinite Word.

Gabriele Fici

J. Integer Seq., 2015

Abelian Powers and Repetitions in Sturmian Words.

Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston

CoRR, 2015

Online Computation of Abelian Runs.

Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston

Proceedings of the Language and Automata Theory and Applications, 2015

On the Number of Closed Factors in a Word.

Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták

Proceedings of the Language and Automata Theory and Applications, 2015

Words with the Maximum Number of Abelian Squares.

Gabriele Fici, Filippo Mignosi

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

A subquadratic algorithm for minimum palindromic factorization.

Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa

J. Discrete Algorithms, 2014

On the structure of bispecial Sturmian words.

Gabriele Fici

J. Comput. Syst. Sci., 2014

Algorithms for computing Abelian periods of words.

Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston

Discret. Appl. Math., 2014

Universal Lyndon Words.

Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Normal, Abby Normal, Prefix Normal.

Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

On Combinatorial Generation of Prefix Normal Words.

Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Splicing Systems from Past to Future: Old and New Challenges.

Luc Boasson, Paola Bonizzoni, Clelia De Felice, Isabelle Fagnot, Gabriele Fici, Rocco Zaccagnino, Rosalba Zizza

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

On the least number of palindromes contained in an infinite word.

Gabriele Fici, Luca Q. Zamboni

Theor. Comput. Sci., 2013

Enumeration and structure of trapezoidal words.

Michelangelo Bucci, Alessandro De Luca, Gabriele Fici

Theor. Comput. Sci., 2013

Binary jumbled string matching for highly run-length compressible texts.

Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták

Inf. Process. Lett., 2013

A Note on Words With the Smallest Number of Closed Factors

Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták

CoRR, 2013

Abelian Repetitions in Sturmian Words.

Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Open and Closed Prefixes of Sturmian Words.

Alessandro De Luca, Gabriele Fici

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Automata and differentiable words.

Jean-Marc Fedou, Gabriele Fici

Theor. Comput. Sci., 2012

On Approximate Jumbled Pattern Matching in Strings.

Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták

Theory Comput. Syst., 2012

Algorithms for Jumbled Pattern Matching in Strings.

Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták

Int. J. Found. Comput. Sci., 2012

Topological properties of cellular automata on trees

Gabriele Fici, Francesca Fiorenzi

Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

Binary Jumbled String Matching: Faster Indexing in Less Space

Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták

CoRR, 2012

Vertical representation of C{\infty}-words

Jean-Marc Fedou, Gabriele Fici

CoRR, 2012

Quasi-linear Time Computation of the Abelian Periods of a Word.

Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth

Proceedings of the Prague Stringology Conference 2012, 2012

A Characterization of Bispecial Sturmian Words.

Gabriele Fici

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Special factors and the combinatorics of suffix and factor automata.

Gabriele Fici

Theor. Comput. Sci., 2011

A Classification of Trapezoidal Words

Gabriele Fici

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Computing Abelian Periods in Words.

Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston

Proceedings of the Prague Stringology Conference 2011, 2011

On Prefix Normal Words.

Gabriele Fici, Zsuzsanna Lipták

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

On the regularity of circular splicing languages: a survey and new developments.

Paola Bonizzoni, Clelia de Felice, Gabriele Fici, Rosalba Zizza

Nat. Comput., 2010

On the Minimal Uncompletable Word Problem

Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch

CoRR, 2010

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching.

Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

A characterization of regular circular languages generated by marked splicing systems.

Clelia de Felice, Gabriele Fici, Rosalba Zizza

Theor. Comput. Sci., 2009

Searching for Jumbled Patterns in Strings.

Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Combinatorics of Finite Words and Suffix Automata.

Gabriele Fici

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2007

Marked Systems and Circular Splicing.

Clelia de Felice, Gabriele Fici, Rosalba Zizza

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006

Minimal Forbidden Words and Applications. (Mots interdits minimaux et applications).

Gabriele Fici

PhD thesis, 2006

Word assembly through minimal forbidden words.

Gabriele Fici, Filippo Mignosi, Antonio Restivo, Marinella Sciortino

Theor. Comput. Sci., 2006

2005

Presentations of constrained systems with unconstrained positions.

Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici

IEEE Trans. Inf. Theory, 2005