On a conjecture on maximal planar sequences. - Stefano Fanelli (J. Graph Theory, 1980)

An unresolved conjecture on nonmaximal planar graphical sequences. - Stefano Fanelli (Discret. Math., 1981)

Exploring and comparing the best "direct methods" for the efficient training of MLP-networks. - M. Di Martino; Stefano Fanelli; Marco Protasi (IEEE Trans. Neural Networks, 1996)

Suspiciousness of loading problems. - Paolo Frasconi; Marco Gori; Stefano Fanelli; Marco Protasi (ICNN, 1997)

Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent. - Monica Bianchini; Stefano Fanelli; Marco Gori; Marco Protasi (ICONIP (1), 1997)

Terminal attractor algorithms: A critical analysis. - Monica Bianchini; Stefano Fanelli; Marco Gori; Marco Maggini (Neurocomputing, 1997)

An Application of ELISA to Perfect Hashing with Deterministic Ordering. - Monica Bianchini; Stefano Fanelli; Marco Gori (ICONIP, 1998)

Optimal Algorithms for Well-Conditioned Nonlinear Systems of Equations. - Monica Bianchini; Stefano Fanelli; Marco Gori (IEEE Trans. Computers, 2001)

Matrix algebras in Quasi-Newton methods for unconstrained minimization. - Carmine Di Fiore; Stefano Fanelli; Filomena Lepore; Paolo Zellini (Numerische Mathematik, 2003)

A new class of quasi-Newtonian methods for optimal learning in MLP-networks. - Alessandro Bortoletti; Carmine Di Fiore; Stefano Fanelli; Paolo Zellini (IEEE Trans. Neural Networks, 2003)

An Efficient Generalization of Battiti-Shanno's Quasi-Newton Algorithm for Learning in MLP-Networks. - Carmine Di Fiore; Stefano Fanelli; Paolo Zellini (ICONIP, 2004)

Low-complexity minimization algorithms. - Carmine Di Fiore; Stefano Fanelli; Paolo Zellini (Numer. Linear Algebra Appl., 2005)