| Efficient computation of zero-dimensional Gröbner bases by change of ordering JC Faugere, P Gianni, D Lazard, T Mora Journal of Symbolic Computation 16 (4), 329-344, 1993 | 1001 | 1993 |
| An introduction to commutative and noncommutative Gröbner bases T Mora Theoretical Computer Science 134 (1), 131-173, 1994 | 388 | 1994 |
| The Gröbner fan of an ideal T Mora, L Robbiano Journal of Symbolic Computation 6 (2-3), 183-208, 1988 | 345 | 1988 |
| “One sugar cube, please” or selection strategies in the Buchberger algorithm A Giovini, T Mora, G Niesi, L Robbiano, C Traverso Proceedings of the 1991 international symposium on Symbolic and algebraic …, 1991 | 285 | 1991 |
| Gröbner bases for non-commutative polynomial rings F Mora International Conference on Applied Algebra, Algebraic Algorithms, and Error …, 1985 | 255 | 1985 |
| New constructive methods in classical ideal theory HM Möller, F Mora Journal of Algebra 100 (1), 138-178, 1986 | 222 | 1986 |
| Gröbner bases of ideals defined by functionals with an application to ideals of projective points MG Marinari, HM Moeller, T Mora Applicable Algebra in Engineering, Communication and Computing 4, 103-145, 1993 | 211 | 1993 |
| Upper and lower bounds for the degree of Gröbner bases HM Möller, F Mora International Symposium on Symbolic and Algebraic Manipulation, 172-183, 1984 | 180 | 1984 |
| Algebrric solution of systems of polynomirl equations using Groebher bases P Gianni, T Mora International Conference on Applied Algebra, Algebraic Algorithms, and Error …, 1987 | 175 | 1987 |
| Solving polynomial equation systems II: Volume 2: Macaulay's paradigm and Gröbner technology T Mora Cambridge University Press, 2003 | 167* | 2003 |
| An algorithm to compute the equations of tangent cones F Mora European Computer Algebra Conference, 158-165, 1982 | 153 | 1982 |
| The shape of the Shape Lemma E Becker, T Mora, MG Marinari, C Traverso Proceedings of the international symposium on Symbolic and algebraic …, 1994 | 129 | 1994 |
| Solving Polynomial Equation Systems IV: Volume 4, Buchberger Theory and Beyond T Mora Cambridge University Press, 2016 | 121* | 2016 |
| Gröbner bases computation using syzygies HM Möller, T Mora, C Traverso Papers from the international symposium on Symbolic and algebraic …, 1992 | 119 | 1992 |
| On multiplicities in polynomial system solving M Marinari, H Möller, T Mora Transactions of the American Mathematical Society 348 (8), 3283-3321, 1996 | 94 | 1996 |
| Seven variations on standard bases T Mora Dipt., Univ., 1988 | 89 | 1988 |
| Groebner bases in non-commutative algebras T Mora International Symposium on Symbolic and Algebraic Computation, 150-161, 1988 | 82 | 1988 |
| Why you cannot even hope to use Gröbner bases in public key cryptography: an open letter to a scientist who failed and a challenge to those who have not yet failed B Barkee, DC Can, J Ecks, T Moriarty, RF Ree Journal of Symbolic Computation 18 (6), 497-501, 1994 | 65 | 1994 |
| The computation of the Hilbert function F Mora, HM Möller European Conference on Computer Algebra, 157-167, 1983 | 63 | 1983 |
| Gröbner bases of ideals given by dual bases MG Marinari, HM Möller, T Mora Proceedings of the 1991 international symposium on Symbolic and algebraic …, 1991 | 59 | 1991 |
