Word problems and ceers. - Valentino Delle Rose; Luca San Mauro; Andrea Sorbi (Math. Log. Q., 2020)

Probabilistic vs Deterministic Gamblers. - Laurent Bienvenu; Valentino Delle Rose; Tomasz Steifer (STACS, 2022)

Find a witness or shatter: the landscape of computable PAC learning. - Valentino Delle Rose; Alexander Kozachinskiy; Cristóbal Rojas; Tomasz Steifer (COLT, 2023)

Three Iterations of (d - 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points. - Valentino Delle Rose; Alexander Kozachinskiy; Cristobal Rojas; Mircea Petrache; Pablo Barceló (NeurIPS, 2023)

Relativized depth. - Laurent Bienvenu; Valentino Delle Rose; Wolfgang Merkle (Theor. Comput. Sci., 2023)

Classifying word problems of finitely generated algebras via computable reducibility. - Valentino Delle Rose; Luca San Mauro; Andrea Sorbi (Int. J. Algebra Comput., 2023)

Effective Littlestone dimension. - Valentino Delle Rose; Alexander Kozachinskiy; Tomasz Steifer (ALT, 2025)

On statistical learning of graphs. - Vittorio Cipriani; Valentino Delle Rose; Luca San Mauro; Giovanni Solda (CoRR, 2025)