| 2008 | DLT | Well Quasi-orders in Formal Language Theory. | Flavio D'Alessandro, Stefano Varricchio |
| 2006 | DLT | Well Quasi Orders and the Shuffle Closure of Finite Sets. | Flavio D'Alessandro, Gwnal Richomme, Stefano Varricchio |
| 2004 | DLT | Avoidable Sets and Well Quasi-Orders. | Flavio D'Alessandro, Stefano Varricchio |
| 2003 | DLT | On Well Quasi-orders on Languages. | Flavio D'Alessandro, Stefano Varricchio |
| 1999 | DLT | Special factors in some combinational structures. | Arturo Carpi, Aldo de Luca, Stefano Varricchio |
| 1998 | ALT | Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries. | Giovanna Melideo, Stefano Varricchio |
| 1996 | FOCS | On the Applications of Multiplicity Automata in Learning. | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
| 1996 | STOC | Learning Sat- | Francesco Bergadano, Dario Catalano, Stefano Varricchio |
| 1994 | CIAC | Learning Behaviors of Automata from Multiplicity and Equivalence Queries. | Francesco Bergadano, Stefano Varricchio |
| 1993 | STACS | Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages. | Stefano Varricchio |
| 1992 | LATIN | Some Regularity Conditions Based on Well Quasi-Orders. | Aldo de Luca, Stefano Varricchio |
| 1990 | ICALP | On Non-Counting Regular Classes. | Aldo de Luca, Stefano Varricchio |
| 1988 | MFCS | Bisections of Free Monoids and a New Unavoidable Regularity. | Stefano Varricchio |