| |
| 2003 | ||
|---|---|---|
| 7 | EE | Ferdinando Mora: De Nugis Groebnerialium 2: Applying Macaulay's Trick in Order to Easily Write a Gröbner Basis. Appl. Algebra Eng. Commun. Comput. 13(6): 437-446 (2003) |
| 1985 | ||
| 6 | Ferdinando Mora: Groebner Bases for Non-Commutative Polynomial Rings. AAECC 1985: 353-362 | |
| 5 | Ferdinando Mora: An Algorithmic Approach to Local Rings. European Conference on Computer Algebra (2) 1985: 518-525 | |
| 1984 | ||
| 4 | H. Michael Möller, Ferdinando Mora: Computational aspects of reduction strategies to construct resolutions of monomial ideals. AAECC 1984: 182-197 | |
| 3 | H. Michael Möller, Ferdinando Mora: Upper and Lower Bounds for the Degree of Groebner Bases. EUROSAM 1984: 172-183 | |
| 1983 | ||
| 2 | Ferdinando Mora, H. Michael Möller: The computation of the Hilbert function. EUROCAL 1983: 157-167 | |
| 1982 | ||
| 1 | Ferdinando Mora: An Algorithm to Compute the Equations of Tangent Cones. EUROCAM 1982: 158-165 | |
| 1 | H. Michael Möller | [2] [3] [4] |