default search action
Gabriele Fici
Person information
- affiliation: University of Palermo, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i49]Gabriele Fici, Jeffrey O. Shallit, Jamie Simpson:
Some Remarks on Palindromic Periodicities. CoRR abs/2407.10564 (2024) - 2023
- [j40]Gabriele Fici
, Svetlana Puzynina:
Abelian combinatorics on words: A survey. Comput. Sci. Rev. 47: 100532 (2023) - [c30]Gabriele Fici
On the Impact of Morphisms on BWT-Runs. CPM 2023: 10:1-10:18 - [c29]Giulia Bernardini
Substring Complexity in Sublinear Space. ISAAC 2023: 12:1-12:19 - 2022
- [j39]Gabriele Fici
Properties of a class of Toeplitz words. Theor. Comput. Sci. 922: 1-12 (2022) - [j38]Alessandro De Luca
On the Lie complexity of Sturmian words. Theor. Comput. Sci. 938: 81-85 (2022) - [c28]Golnaz Badkobeh
Maximal Closed Substrings. SPIRE 2022: 16-23 - [i48]Alessandro De Luca, Gabriele Fici
Lie Complexity of Sturmian Words. CoRR abs/2206.00995 (2022) - [i47]Gabriele Fici
Abelian Combinatorics on Words: a Survey. CoRR abs/2207.09937 (2022) - [i46]Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici
Maximal Closed Substrings. CoRR abs/2209.00271 (2022) - [i45]Alessandro De Luca, Gabriele Fici
Some Results on Digital Segments and Balanced Words. CoRR abs/2211.09417 (2022) - 2021
- [j37]Giulia Bernardini
Reverse-Safe Text Indexing. ACM J. Exp. Algorithmics 26: 1.10:1-1.10:26 (2021) - [j36]Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici
Constructing Antidictionaries of Long Texts in Output-Sensitive Space. Theory Comput. Syst. 65(5): 777-797 (2021) - [j35]Giuseppa Castiglione, Gabriele Fici
Primitive sets of words. Theor. Comput. Sci. 866: 25-36 (2021) - [j34]Gabriele Fici
Adaptive learning of compressible strings. Theor. Comput. Sci. 896: 46-52 (2021) - [i44]Gabriele Fici, Jeffrey O. Shallit:
Properties of a Class of Toeplitz Words. CoRR abs/2112.12125 (2021) - 2020
- [j33]Gabriele Fici
Preface. Theor. Comput. Sci. 812: 1 (2020) - [j32]Péter Burcsi, Gabriele Fici
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. 842: 86-99 (2020) - [c27]Giulia Bernardini
Reverse-Safe Data Structures for Text Indexing. ALENEX 2020: 199-213 - [i43]Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. CoRR abs/2003.03222 (2020) - [i42]Giuseppa Castiglione, Gabriele Fici, Antonio Restivo:
Primitive Sets of Words. CoRR abs/2005.10668 (2020) - [i41]Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis:
Substring Complexity in Sublinear Space. CoRR abs/2007.08357 (2020) - [i40]Gabriele Fici, Nicola Prezza, Rossano Venturini:
Substring Query Complexity of String Reconstruction. CoRR abs/2011.07143 (2020)
2010 – 2019
- 2019
- [j31]Gabriele Fici
Abelian antipowers in infinite words. Adv. Appl. Math. 108: 67-78 (2019) - [j30]Clelia De Felice, Gabriele Fici, Antonio Restivo:
Aldo de Luca (1941 - 2018). Bull. EATCS 127 (2019) - [j29]Gabriele Fici
Minimal forbidden factors of circular words. Theor. Comput. Sci. 792: 144-153 (2019) - [c26]Giuseppa Castiglione, Gabriele Fici
On Sets of Words of Rank Two. WORDS 2019: 46-59 - [c25]Lorraine A. K. Ayad
Constructing Antidictionaries in Output-Sensitive Space. DCC 2019: 538-547 - [c24]Gabriele Fici
Minimal Absent Words in Rooted and Unrooted Trees. SPIRE 2019: 152-161 - [i39]Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis:
Constructing Antidictionaries in Output-Sensitive Space. CoRR abs/1902.04785 (2019) - [i38]Gabriele Fici, Pawel Gawrychowski:
Minimal Absent Words in Rooted and Unrooted Trees. CoRR abs/1907.12034 (2019) - 2018
- [j28]Panagiotis Charalampopoulos
Alignment-free sequence comparison using absent words. Inf. Comput. 262: 57-68 (2018) - [j27]Golnaz Badkobeh, Gabriele Fici
Algorithms for anti-powers in strings. Inf. Process. Lett. 137: 57-60 (2018) - [j26]Gabriele Fici
Anti-powers in infinite words. J. Comb. Theory A 157: 109-119 (2018) - [i37]Golnaz Badkobeh, Gabriele Fici, Simon J. Puglisi:
Algorithms for Anti-Powers in Strings. CoRR abs/1805.10042 (2018) - [i36]Gabriele Fici, Zsuzsanna Lipták:
On Prefix Normal Words. CoRR abs/1805.12405 (2018) - [i35]Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Alignment-free sequence comparison using absent words. CoRR abs/1806.02718 (2018) - [i34]Giuseppa Castiglione, Gabriele Fici, Antonio Restivo:
On k-Maximal Submonoids, with Applications in Combinatorics on Words. CoRR abs/1810.02182 (2018) - [i33]Gabriele Fici, Mickaël Postic, Manuel Silva:
Abelian Anti-Powers in Infinite Words. CoRR abs/1810.12275 (2018) - 2017
- [j25]Alessandro De Luca
The sequence of open and closed prefixes of a Sturmian word. Adv. Appl. Math. 90: 27-45 (2017) - [j24]Gabriele Fici:
Open and ClosedWords. Bull. EATCS 123 (2017) - [j23]Julien Cassaigne, Gabriele Fici
Cyclic complexity of words. J. Comb. Theory A 145: 36-56 (2017) - [j22]Peter Burcsi
On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659: 1-13 (2017) - [j21]Gabriele Fici
Abelian-square-rich words. Theor. Comput. Sci. 684: 29-42 (2017) - [c23]Gabriele Fici
Minimal Forbidden Factors of Circular Words. WORDS 2017: 36-48 - [e1]Gabriele Fici, Marinella Sciortino, Rossano Venturini:
String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings. Lecture Notes in Computer Science 10508, Springer 2017, ISBN 978-3-319-67427-8 [contents] - [i32]Gabriele Fici, Filippo Mignosi, Jeffrey O. Shallit:
Abelian-Square-Rich Words. CoRR abs/1701.00948 (2017) - [i31]Alessandro De Luca, Gabriele Fici, Luca Q. Zamboni:
The sequence of open and closed prefixes of a Sturmian word. CoRR abs/1701.01580 (2017) - [i30]Gabriele Fici, Antonio Restivo, Laura Rizzo:
Minimal Forbidden Factors of Circular Words. CoRR abs/1707.04450 (2017) - 2016
- [j20]Gabriele Fici
A note on easy and efficient computation of full abelian periods of a word. Discret. Appl. Math. 212: 88-95 (2016) - [j19]Gabriele Fici
On the greedy algorithm for the Shortest Common Superstring problem with reversals. Inf. Process. Lett. 116(3): 245-251 (2016) - [j18]Gabriele Fici
Abelian powers and repetitions in Sturmian words. Theor. Comput. Sci. 635: 16-34 (2016) - [j17]Gabriele Fici
Fast computation of abelian runs. Theor. Comput. Sci. 656: 256-264 (2016) - [c22]Gabriele Fici
Anti-Powers in Infinite Words. ICALP 2016: 124:1-124:9 - [c21]Maxime Crochemore, Gabriele Fici
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. LATIN 2016: 334-346 - [i29]Gabriele Fici, Antonio Restivo, Manuel Silva, Luca Q. Zamboni:
Anti-Powers in Infinite Words. CoRR abs/1606.02868 (2016) - [i28]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Prefix Normal Words and Prefix Normal Forms. CoRR abs/1611.09017 (2016) - 2015
- [j16]Gabriele Fici:
Factorizations of the Fibonacci Infinite Word. J. Integer Seq. 18(9): 15.9.3 (2015) - [j15]Jean-Marc Fedou, Gabriele Fici
Vertical representation of C∞-words. Theor. Comput. Sci. 565: 90-101 (2015) - [c20]Gabriele Fici
Words with the Maximum Number of Abelian Squares. WORDS 2015: 122-134 - [c19]Golnaz Badkobeh, Gabriele Fici
On the Number of Closed Factors in a Word. LATA 2015: 381-390 - [c18]Gabriele Fici
Online Computation of Abelian Runs. LATA 2015: 391-401 - [i27]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Online Computation of Abelian Runs. CoRR abs/1501.01429 (2015) - [i26]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Powers and Repetitions in Sturmian Words. CoRR abs/1506.02797 (2015) - [i25]Gabriele Fici, Filippo Mignosi:
Words with the Maximum Number of Abelian Squares. CoRR abs/1506.03562 (2015) - [i24]Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. CoRR abs/1506.04917 (2015) - [i23]Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Fast Computation of Abelian Runs. CoRR abs/1506.08518 (2015) - [i22]Gabriele Fici:
Factorizations of the Fibonacci Infinite Word. CoRR abs/1508.06754 (2015) - [i21]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth:
A Note on Easy and Efficient Computation of Full Abelian Periods of a Word. CoRR abs/1510.00634 (2015) - [i20]Luc Boasson, Paola Bonizzoni, Clelia De Felice, Isabelle Fagnot, Gabriele Fici, Rocco Zaccagnino, Rosalba Zizza:
Splicing Systems from Past to Future: Old and New Challenges. CoRR abs/1510.01574 (2015) - [i19]Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals. CoRR abs/1511.08431 (2015) - 2014
- [j14]Gabriele Fici
Algorithms for computing Abelian periods of words. Discret. Appl. Math. 163: 287-297 (2014) - [j13]Gabriele Fici
On the structure of bispecial Sturmian words. J. Comput. Syst. Sci. 80(4): 711-719 (2014) - [j12]Gabriele Fici
A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28: 41-48 (2014) - [c17]Luc Boasson, Paola Bonizzoni, Clelia De Felice, Isabelle Fagnot, Gabriele Fici, Rocco Zaccagnino, Rosalba Zizza:
Splicing Systems from Past to Future: Old and New Challenges. Discrete Mathematics and Computer Science 2014: 51-76 - [c16]Peter Burcsi
On Combinatorial Generation of Prefix Normal Words. CPM 2014: 60-69 - [c15]Peter Burcsi
Normal, Abby Normal, Prefix Normal. FUN 2014: 74-88 - [c14]Arturo Carpi, Gabriele Fici
Universal Lyndon Words. MFCS (1) 2014: 135-146 - [c13]Julien Cassaigne, Gabriele Fici
Cyclic Complexity of Words. MFCS (1) 2014: 159-170 - [i18]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CoRR abs/1401.6346 (2014) - [i17]Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni:
Cyclic Complexity of Words. CoRR abs/1402.5843 (2014) - [i16]Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa:
A Subquadratic Algorithm for Minimum Palindromic Factorization. CoRR abs/1403.2431 (2014) - [i15]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. CoRR abs/1404.2824 (2014) - [i14]Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino:
Universal Lyndon Words. CoRR abs/1406.5895 (2014) - 2013
- [j11]Golnaz Badkobeh, Gabriele Fici
Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett. 113(17): 604-608 (2013) - [j10]Michelangelo Bucci, Alessandro De Luca
Enumeration and structure of trapezoidal words. Theor. Comput. Sci. 468: 12-22 (2013) - [j9]Gabriele Fici
On the least number of palindromes contained in an infinite word. Theor. Comput. Sci. 481: 1-8 (2013) - [c12]Alessandro De Luca
Open and Closed Prefixes of Sturmian Words. WORDS 2013: 132-142 - [c11]Gabriele Fici
Abelian Repetitions in Sturmian Words. Developments in Language Theory 2013: 227-238 - [i13]Gabriele Fici, Luca Q. Zamboni:
On the least number of palindromes contained in an infinite word. CoRR abs/1301.3376 (2013) - [i12]Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták:
A Note on Words With the Smallest Number of Closed Factors. CoRR abs/1305.6395 (2013) - [i11]Alessandro De Luca, Gabriele Fici:
Open and Closed Prefixes of Sturmian Words. CoRR abs/1306.2254 (2013) - [i10]Gabriele Fici:
On the Structure of Bispecial Sturmian Words. CoRR abs/1311.4904 (2013) - 2012
- [j8]Peter Burcsi
Algorithms for Jumbled Pattern Matching in Strings. Int. J. Found. Comput. Sci. 23(2): 357-374 (2012) - [j7]Peter Burcsi
On Approximate Jumbled Pattern Matching in Strings. Theory Comput. Syst. 50(1): 35-51 (2012) - [j6]Jean-Marc Fedou, Gabriele Fici
Automata and differentiable words. Theor. Comput. Sci. 443: 46-62 (2012) - [c10]Gabriele Fici
A Characterization of Bispecial Sturmian Words. MFCS 2012: 383-394 - [c9]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth:
Quasi-linear Time Computation of the Abelian Periods of a Word. Stringology 2012: 103-110 - [c8]Gabriele Fici
Topological properties of cellular automata on trees. AUTOMATA & JAC 2012: 255-266 - [i9]Jean-Marc Fedou, Gabriele Fici:
Vertical representation of C{\infty}-words. CoRR abs/1202.5154 (2012) - [i8]Michelangelo Bucci, Alessandro De Luca, Gabriele Fici:
Enumeration and Structure of Trapezoidal Words. CoRR abs/1203.1203 (2012) - [i7]Gabriele Fici:
A Characterization of Bispecial Sturmian Words. CoRR abs/1204.1672 (2012) - [i6]Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták:
Binary Jumbled String Matching: Faster Indexing in Less Space. CoRR abs/1206.2523 (2012) - [i5]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Repetitions in Sturmian Words. CoRR abs/1209.6013 (2012) - [i4]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Algorithms for Computing Abelian Periods of Words. CoRR abs/1211.5389 (2012) - 2011
- [j5]Gabriele Fici
Special factors and the combinatorics of suffix and factor automata. Theor. Comput. Sci. 412(29): 3604-3615 (2011) - [c7]Gabriele Fici
On Prefix Normal Words. Developments in Language Theory 2011: 228-238 - [c6]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Computing Abelian Periods in Words. Stringology 2011: 184-196 - [c5]Gabriele Fici
A Classification of Trapezoidal Words. WORDS 2011: 129-137 - [i3]Jean-Marc Fedou, Gabriele Fici:
Automata and differentiable words. CoRR abs/1102.0913 (2011) - [i2]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Algorithms for Jumbled Pattern Matching in Strings. CoRR abs/1102.1746 (2011) - 2010
- [j4]Paola Bonizzoni
On the regularity of circular splicing languages: a survey and new developments. Nat. Comput. 9(2): 397-420 (2010) - [c4]Peter Burcsi
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. FUN 2010: 89-101 - [i1]Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch:
On the Minimal Uncompletable Word Problem. CoRR abs/1002.1928 (2010)
2000 – 2009
- 2009
- [j3]Clelia de Felice
A characterization of regular circular languages generated by marked splicing systems. Theor. Comput. Sci. 410(47-49): 4937-4960 (2009) - [c3]Gabriele Fici
Combinatorics of Finite Words and Suffix Automata. CAI 2009: 250-259 - [c2]Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Searching for Jumbled Patterns in Strings. Stringology 2009: 105-117 - 2007
- [c1]Clelia de Felice
Marked Systems and Circular Splicing. FCT 2007: 238-249 - 2006
- [b1]Gabriele Fici:
Minimal Forbidden Words and Applications. (Mots interdits minimaux et applications). University of Marne-la-Vallée, Marne la Vallée, France, 2006 - [j2]Gabriele Fici
Word assembly through minimal forbidden words. Theor. Comput. Sci. 359(1-3): 214-230 (2006) - 2005
- [j1]Marie-Pierre Béal, Maxime Crochemore
Presentations of constrained systems with unconstrained positions. IEEE Trans. Inf. Theory 51(5): 1891-1900 (2005)
Coauthor Index
Élise Prieur
aka: Élise Prieur-Gaston
aka: Élise Prieur-Gaston
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: