An Algorithm to Compute the Equations of Tangent Cones. - Ferdinando Mora (EUROCAM, 1982)

The computation of the Hilbert function. - Ferdinando Mora; H. Michael Möller (EUROCAL, 1983)

Computational aspects of reduction strategies to construct resolutions of monomial ideals. - H. Michael Möller; Ferdinando Mora (AAECC, 1984)

Upper and Lower Bounds for the Degree of Groebner Bases. - H. Michael Möller; Ferdinando Mora (EUROSAM, 1984)

The interplay between commutative algebra and computer algebra. - Ferdinando Mora; Lorenzo Robbiano (SIGSAM Bull., 1984)

Groebner Bases for Non-Commutative Polynomial Rings. - Ferdinando Mora (AAECC, 1985)

An Algorithmic Approach to Local Rings. - Ferdinando Mora (European Conference on Computer Algebra (2), 1985)

De Nugis Groebnerialium 2: Applying Macaulay's Trick in Order to Easily Write a Gröbner Basis. - Ferdinando Mora (Appl. Algebra Eng. Commun. Comput., 2003)

De Nugis Groebnerialium 4: Zacharias, Spears, Möller. - Ferdinando Mora (ISSAC, 2015)

Degröbnerization and Its Applications: Reverse Engineering of Gene Regulatory Networks (poster paper). - Michela Ceria; Samuel Lundqvist; Ferdinando Mora (SC-Square@SIAM AG, 2021)

A Degroebnerization Approach to Algebraic Statistics. - Michela Ceria; Ferdinando Mora (ISSAC, 2022)

De Nugis Groebnerialium 6: Rump, Ufnarovski, Zacharias. - Michela Ceria; Ferdinando Mora (Appl. Algebra Eng. Commun. Comput., 2022)

De Nugis Groebnerialium 7: Janet, Gerdt, Tamari. - Michela Ceria; Ferdinando Mora (Math. Comput. Sci., 2022)