Luca Q. Zamboni · EDBT 2026 Demo

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 24

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

3 papers

Combinatorics and discrete mathematics · 64% Automata and formal languages · 36%

Topics — the 2 heaviest of 3, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Combinatorics and discrete mathematics combinatorics on words	0.4	2	2016	Anti-Powers in Infinite Words · ICALP 2016 Self-shuffling Words · ICALP (2) 2013
Automata and formal languages infinite words	0.2	1	2016	Anti-Powers in Infinite Words · ICALP 2016

Year	Publication	Venue	Position
2020	ω-Lyndon words Mickaël Postic, Luca Q. Zamboni	Theor. Comput. Sci.	2
2020	Reprint of: ω-Lyndon words Mickaël Postic, Luca Q. Zamboni	Theor. Comput. Sci.	2
2016	Anti-Powers in Infinite Words Gabriele Fici, Antonio Restivo, Manuel Silva 0003, Luca Q. Zamboni	ICALP	4
2015	Words 2013 Juhani Karhumäki, Luca Q. Zamboni	Theor. Comput. Sci.	2
2014	Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni	Developments in Language Theory	3
2014	Subword Complexity and Decomposition of the Set of Factors Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni	MFCS (1)	4
2014	Cyclic Complexity of Words Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni	MFCS (1)	4
2013	A Coloring Problem for Sturmian and Episturmian Words abstract We consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word w, does there exist a finite coloring of its factors such that no factorization of w is monochromatic? We show that such a coloring always exists whenever w is a Sturmian word or a standard episturmian word. © 2013 Springer-Verlag. Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni	Developments in Language Theory	3
2013	Self-shuffling Words Émilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni	ICALP (2)	4
2013	Reversible Christoffel factorizations Michelangelo Bucci, Alessandro De Luca 0002, Luca Q. Zamboni	Theor. Comput. Sci.	3
2013	On the least number of palindromes contained in an infinite word Gabriele Fici, Luca Q. Zamboni	Theor. Comput. Sci.	2
2012	Some Characterizations of Sturmian Words in Terms of the Lexicographic Order abstract In this paper we present three new characterizations of Sturmian words based on the lexicographic ordering of their factors. Michelangelo Bucci, Alessandro De Luca 0002, Luca Q. Zamboni	Fundam. Informaticae	3
2010	On graphs of central episturmian words Aldo de Luca, Luca Q. Zamboni	Theor. Comput. Sci.	2
2009	A new characteristic property of rich words Michelangelo Bucci, Alessandro De Luca 0002, Amy Glen, Luca Q. Zamboni	Theor. Comput. Sci.	4
2009	Fine and Wilf words for any periods II Robert Tijdeman, Luca Q. Zamboni	Theor. Comput. Sci.	2
2008	Relationally Periodic Sequences and Subword Complexity Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni	Developments in Language Theory	3
2008	On different generalizations of episturmian words Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002, Luca Q. Zamboni	Theor. Comput. Sci.	4
2008	Rich, Sturmian, and trapezoidal words Aldo de Luca, Amy Glen, Luca Q. Zamboni	Theor. Comput. Sci.	3
2007	Suffix Automata and Standard Sturmian Words Marinella Sciortino, Luca Q. Zamboni	Developments in Language Theory	2
2004	On representations of positive integers in the Fibonacci base Marcia Edson, Luca Q. Zamboni	Theor. Comput. Sci.	2
2004	Characterisations of balanced words via orderings Oliver Jenkinson, Luca Q. Zamboni	Theor. Comput. Sci.	2
2004	Periodicity and local complexity Anthony Quas, Luca Q. Zamboni	Theor. Comput. Sci.	2
2001	Combinatorics of Three-Interval Exchanges Sébastien Ferenczi, Charles Holton, Luca Q. Zamboni	ICALP	3
1999	Descendants of Primitive Substitutions Charles Holton, Luca Q. Zamboni	Theory Comput. Syst.	2