Gabriele Fici

Orcid: 0000-0002-3536-327X

Affiliations:
  • University of Palermo, Italy


According to our database1, Gabriele Fici authored at least 78 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Some Remarks on Palindromic Periodicities.
CoRR, 2024

2023
Abelian combinatorics on words: A survey.
Comput. Sci. Rev., February, 2023

Substring Complexity in Sublinear Space.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

On the Impact of Morphisms on BWT-Runs.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
On the Lie complexity of Sturmian words.
Theor. Comput. Sci., 2022

Properties of a class of Toeplitz words.
Theor. Comput. Sci., 2022

Some Results on Digital Segments and Balanced Words.
CoRR, 2022

Maximal Closed Substrings.
Proceedings of the String Processing and Information Retrieval, 2022

2021
Adaptive learning of compressible strings.
Theor. Comput. Sci., 2021

Primitive sets of words.
Theor. Comput. Sci., 2021

Constructing Antidictionaries of Long Texts in Output-Sensitive Space.
Theory Comput. Syst., 2021

Reverse-Safe Text Indexing.
ACM J. Exp. Algorithmics, 2021

2020
Preface.
Theor. Comput. Sci., 2020

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word.
Theor. Comput. Sci., 2020

Substring Query Complexity of String Reconstruction.
CoRR, 2020

Reverse-Safe Data Structures for Text Indexing.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Minimal forbidden factors of circular words.
Theor. Comput. Sci., 2019

Aldo de Luca (1941 - 2018).
Bull. EATCS, 2019

Abelian antipowers in infinite words.
Adv. Appl. Math., 2019

Minimal Absent Words in Rooted and Unrooted Trees.
Proceedings of the String Processing and Information Retrieval, 2019

Constructing Antidictionaries in Output-Sensitive Space.
Proceedings of the Data Compression Conference, 2019

On Sets of Words of Rank Two.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018
Anti-powers in infinite words.
J. Comb. Theory A, 2018

Algorithms for anti-powers in strings.
Inf. Process. Lett., 2018

Alignment-free sequence comparison using absent words.
Inf. Comput., 2018

Abelian Anti-Powers in Infinite Words.
CoRR, 2018

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

2017
Abelian-square-rich words.
Theor. Comput. Sci., 2017

On prefix normal words and prefix normal forms.
Theor. Comput. Sci., 2017

Cyclic complexity of words.
J. Comb. Theory A, 2017

Open and ClosedWords.
Bull. EATCS, 2017

The sequence of open and closed prefixes of a Sturmian word.
Adv. Appl. Math., 2017

2016
Abelian powers and repetitions in Sturmian words.
Theor. Comput. Sci., 2016

Fast computation of abelian runs.
Theor. Comput. Sci., 2016

On the greedy algorithm for the Shortest Common Superstring problem with reversals.
Inf. Process. Lett., 2016

A note on easy and efficient computation of full abelian periods of a word.
Discret. Appl. Math., 2016

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Vertical representation of C<sup>∞</sup>-words.
Theor. Comput. Sci., 2015

Factorizations of the Fibonacci Infinite Word.
J. Integer Seq., 2015

Abelian Powers and Repetitions in Sturmian Words.
CoRR, 2015

Online Computation of Abelian Runs.
Proceedings of the Language and Automata Theory and Applications, 2015

On the Number of Closed Factors in a Word.
Proceedings of the Language and Automata Theory and Applications, 2015

Words with the Maximum Number of Abelian Squares.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
A subquadratic algorithm for minimum palindromic factorization.
J. Discrete Algorithms, 2014

On the structure of bispecial Sturmian words.
J. Comput. Syst. Sci., 2014

Algorithms for computing Abelian periods of words.
Discret. Appl. Math., 2014

Universal Lyndon Words.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Normal, Abby Normal, Prefix Normal.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

On Combinatorial Generation of Prefix Normal Words.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Splicing Systems from Past to Future: Old and New Challenges.
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.
Theor. Comput. Sci., 2013

Enumeration and structure of trapezoidal words.
Theor. Comput. Sci., 2013

Binary jumbled string matching for highly run-length compressible texts.
Inf. Process. Lett., 2013

A Note on Words With the Smallest Number of Closed Factors
CoRR, 2013

Abelian Repetitions in Sturmian Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Open and Closed Prefixes of Sturmian Words.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012
Automata and differentiable words.
Theor. Comput. Sci., 2012

On Approximate Jumbled Pattern Matching in Strings.
Theory Comput. Syst., 2012

Algorithms for Jumbled Pattern Matching in Strings.
Int. J. Found. Comput. Sci., 2012

Topological properties of cellular automata on trees
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
CoRR, 2012

Vertical representation of C{\infty}-words
CoRR, 2012

Quasi-linear Time Computation of the Abelian Periods of a Word.
Proceedings of the Prague Stringology Conference 2012, 2012

A Characterization of Bispecial Sturmian Words.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Special factors and the combinatorics of suffix and factor automata.
Theor. Comput. Sci., 2011

A Classification of Trapezoidal Words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Computing Abelian Periods in Words.
Proceedings of the Prague Stringology Conference 2011, 2011

On Prefix Normal Words.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
On the regularity of circular splicing languages: a survey and new developments.
Nat. Comput., 2010

On the Minimal Uncompletable Word Problem
CoRR, 2010

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009
A characterization of regular circular languages generated by marked splicing systems.
Theor. Comput. Sci., 2009

Searching for Jumbled Patterns in Strings.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Combinatorics of Finite Words and Suffix Automata.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2007
Marked Systems and Circular Splicing.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006
Minimal Forbidden Words and Applications. (Mots interdits minimaux et applications).
PhD thesis, 2006

Word assembly through minimal forbidden words.
Theor. Comput. Sci., 2006

2005
Presentations of constrained systems with unconstrained positions.
IEEE Trans. Inf. Theory, 2005


  Loading...