Stefano Varricchio

Computer Science · Physical Sciences

15h-index949citations78works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

semigroups and automata theory(66), Advanced Algebra and Logic(29), Algorithms and Data Compression(16), Machine Learning and Algorithms(15), Computability, Logic, AI Algorithms(13)

Publications78 total

Visualizing Text for Token Efficiency: Exploring Multimodal LLMs' Performance in Text-as-Image Input Compression
2025Open Access
Learning Automata
Encyclopedia of Algorithms·2016
Learning Automata
Encyclopedia of Algorithms·2015
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Theoretical Computer Science·2011· 11 cited
Strategic Diagnostic Cityscape S.A. 1
Infoscience (Ecole Polytechnique Fédérale de Lausanne)·2010Open Access
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Theoretical Computer Science·2009· 11 cited
On some counting problems for semi-linear sets
arXiv (Cornell University)·2009· 4 citedOpen Access
On Bounded Rational Trace Languages
Theory of Computing Systems·2008· 4 cited
The Parikh functions of sparse context-free languages are quasi-polynomials
arXiv (Cornell University)·2008Open Access
Well Quasi-orders in Formal Language Theory
Lecture notes in computer science·2008· 8 cited
Learning Automata
Encyclopedia of Algorithms·2008· 1 cited
On the Growth of Context-Free Languages
Justus-Liebig-Universität Gießen·2008· 4 citedOpen Access
On the separability of sparse context-free languages and of bounded rational relations
Theoretical Computer Science·2007· 4 cited
Well quasi-orders generated by a word-shuffle rewriting
Theoretical Computer Science·2007· 2 cited
Well quasi-orders and the shuffle closure of finite sets
arXiv (Cornell University)·2006Open Access
Well quasi-orders, unavoidable sets, and derivation systems
RAIRO - Theoretical Informatics and Applications·2006· 4 cited
On the structure of the counting function of sparse context-free languages
Theoretical Computer Science·2006· 27 cited
Bisections of free monoids and a new unavoidable regularity
Lecture notes in computer science·2005· 1 cited
Well quasi-orders and context-free grammars
Theoretical Computer Science·2004· 7 cited
Avoidable Sets and Well Quasi-Orders
Lecture notes in computer science·2004· 2 cited
page 1 of 4Next →

Frequent Co-authors

Aldo de Luca(19), Flavio D’Alessandro(12), Francesco Bergadano(7), Benedetto Intrigila(5), Nader H. Bshouty(3), Amos Beimel(2), Eyal Kushilevitz(2), Marcella Anselmo(2), Dora Giammarresi(2), Christian Choffrut(2), Giuseppe Pirillo(1), Daniel P. Bovet(1), Dario Catalano(1), Arturo Carpi(1), Anthony M. DeLuca(1), Mariacristina Pelagalli(1), Giovanna Melideo(1)