Teo Mora Publications

• T. Mora, Seven variations on standard bases, (1988) [gzipped tarred postscript].
• T. Mora, Groebner bases and the word problem (1991) [gzipped postscript].
• T. Mora, SPES I: The Kronecker-Duval Philosophy, Cambridge University Press (2003)
• T. Mora, SPES II: Macaulay's Paradigm and Groebner Technology, Cambridge University Press (2005)
• T. Mora. The FGLM Problem and Moeller's Algorithm on Zero-dimensional Ideals. in M.Sala et al., Groebner Bases, Coding, and Cryptography. Springer (2009)27-46[pdf]
• T. Mora. Groebner Technology. in M.Sala et al., Groebner Bases, Coding, and Cryptography. Springer (2009)11-26[pdf]
• E. Orsini, T. Mora,. Decoding cyclic codes: the Cooper Philosophy. in M.Sala et al., Groebner Bases, Coding, and Cryptography. Springer (2009)62-92[pdf]
• E. Byerne, T. Mora. Groebner bases over commutative rings and Applications to coding theory. in M.Sala et al., Groebner Bases, Coding, and Cryptography. Springer (2009) 239-262 [pdf]
• M.G. Marinari, T. Mora, The Axix-of-Evil Theorem (2008) [pdf]
• T. Mora, E. Orsini, and M. Sala, General error locator polynomials for binary cyclic codes with t <= 2 and n < 63, [BCRI preprint, 43, University College Cork, Boole Centre BCRI, UCC Cork, Ireland, 2006.[pdf]
• M.E. Alonso, M.G. Marinari, M.T. Mora, The Big Mother of All the Dualities, II: Macaulay Bases, J. AAECC, 17 (2006) 409--451   [pdf]
• M.G. Marinari, M.T. Mora, Cerlienco-Mureddu Correspondence and Lazard Structural Theorem, Investication Operacional 27 (2006), 155-178 [pdf]
• T. Mora, M.G.Marinari  A Remark on a remark by Macaualay Or Enhancing Lazard Structurasl Theorem. Bull. Iranian Math. Soc. , 29(1):1-45 , 2003.[pdf]
• T. Mora. De Nugis Groebnerialium 2: Applying Macaualay's Trick in order to easily write a Groebner basis, J. AAECC., 13 (2003) 437--446 [gzipped postscript].
• T. Mora, M. Sala, On the Groebner bases of some symmetric systems and their application to Coding Theory, J. Symb. Comp., 35 (2003) 177-194 [gzipped postscript].
• M.E. Alonso, M.G. Marinari, M.T. Mora, The Big Mother of All the Dualities, I: Moeller Algorithm, Comm. Alg. 31 (2003), 783--818   [gzipped postscript]
• M. Caboara, T. Mora, The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Groebner Shape Theorem, J. Appl. Alg.  13 (2002) 209-232 [gzipped postscript]
• M. Borges-Trenard, M. Borges-Quintana, T. Mora, Computing Gr\"obner Bases by FGLM Techniques in a Noncommutative Setting, J. Symb.Comp. 30 (2000) 429-449 [gzipped postscript].
• B.Reinert, K.Madlener, T. Mora, A Note on Nielsen Reduction and Coset Enumeration, Proc. ISSAC98, ACM (1998) 171--178 [gzipped postscript].
• T. Mora, De Nugis Groebnerialium 1: Eagon, Northcott, Groebner, in Groebner Bases and Applications, London Math. Soc. Lecture Notes Series, Vol 251, Cambridge University Press (1998) 434-447 [gzipped postscript].
• E. Green, T. Mora, V. Ufnarovski, The Non-Commutative Groebner Freaks, in Proc. Conf. on Symbolic Rewriting Techniques, Birkhauser (1997) [gzipped postscript].
• T. Mora, A Note on the Castelnuovo Theory, Comm. Alg., 25 (1997), 2343-2354 [gzipped postscript].
• T. Mora, Groebner Duality and multiple points in linearly general position, Proc. AMS [gzipped postscript].
• M.G. Marinari, H.M. Moeller, T. Mora, Groebner Duality and Multiplicities in Polynomial System Solving, Proc. ISSAC95, ACM (1995) [gzipped postscript].
• M.G. Marinari, H.M. Moeller, T. Mora, On multiplicities in Polynomial System Solving, Trans. AMS, 348 (1996), 3283--3321 [gzipped postscript].
• T. Mora, Polynomial System Solving, a Survey , EIDMA minicourse, Computer algebra, (1994) [gzipped postscript].
• T. Mora, M.E. Rossi, An algorithm for the Hilbert function of a primary ideal, Comm. Alg.23 (1995), 1899- 1911 [gzipped postscript].
• S. Licciardi, T. Mora, Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion, Proc. ISSAC94, ACM (1994) 191-196 [gzipped postscript].
• E. Becker, M.G. Marinari, T. Mora, C. Traverso The shape of the Shape Lemma, Proc. ISSAC94, ACM (1994) 129-133 [gzipped postscript].
• B.Barkee, D. C. Can, J. Ecks, T. Moriarty, R.F. Ree Why you cannot even hope to use Groebner bases in public key cryptography , J. Symb.Comp. 18 (1994) 497-501 [gzipped postscript].
• T. Mora, An introduction to commutative and non-commutative Groebner bases, Theor. Comp. Sci., 134 (1994) 131-173 [gzipped postscript].
• A.Assi, T. Mora, The virtues of laziness: the complexity of the tangent cone algorithm, J. AAECC., 4 (1993) 231-238 [gzipped postscript].
• T. Mora, L. Robbiano, Points in affine and projective spaces Computiational Algebraic Geometry and Commutative Algebra (D. Eisenbud, L. Robbiano Eds.) Cambridge Univ. Press (1993), 106-150 [gzipped postscript].
• T. Mora, H. M. Moeller , C. Traverso Groebner Bases Computation Using Syzygies, Proc. ISSAC '92 ACM (1992), [gzipped postscript].
• M.E. Alonso, G. Niesi, T. Mora, M. Raimondo An Algorithm for Computing Analytic Branches of Space Curves at Singular Points , Proc. 1992 Int. Workshop on Mathematics Mechanization, International Academic Publishers (1992), 135-166 [gzipped postscript].
• M.E. Alonso, G. Niesi, T. Mora, M. Raimondo Local Parametrization of Space Curves at Singular Points Computer Graphics and Mathematics (B. Falcidieno, I. Herman, C. Pienovi, eds.), Eurographic Seminar Series, Springer Verlag, 1992, 61-90 [gzipped postscript].
• M.G. Marinari, T. Mora, H.M. Moeller Groebner bases of ideals defined by functionals with an application to ideals of projective points , J. AAECC. 4 (1993), 103-145 [gzipped postscript].
• M.G. Marinari, T. Mora, H.M. Moeller Groebner bases of ideals given by dual bases, Proc. ISSAC '91, ACM (1991) 55-63 [gzipped postscript].
• A. Giovini, T. Mora, G. Niesi, L. Robbiano, C. Traverso "One sugar cube, please"; or: Selection strategies in Buchberger algorithm, Proc. ISSAC '91, ACM (1991) 49-54 [gzipped postscript].
• M.E. Alonso, T. Mora, M. Raimondo On the complexity of algebraic power series, Proc.AAECC 8, LNCS 508 (1991) 197-207 [gzipped postscript].
• M.E. Alonso, T. Mora, M. Raimondo Local decomposition algorithms, Proc.AAECC 8, LNCS 508 (1991) 208-221 [gzipped postscript].
• M.E. Alonso, T. Mora, M. Raimondo A computational model for algebraic power series, J. Pure Appl. Alg. 77 (1992) 1-38 [gzipped postscript].
• T. Mora, La queste del saint Gra(AL) Proc. AAECC7, Disc. Appl. Math. 33 (1991) 161-190 [gzipped postscript].
• J.C. Faugere, P. Gianni, D. Lazard, T. Mora, Efficient computation of zero-dimensional Gr\"obner bases by change of ordering J. Symb. Comp., 16 (1993) 329-344 [gzipped postscript].
• M.E. Alonso, T. Mora, M. Raimondo Computing with algebraic series Proc. ISSAC'89, ACM (1989) 101-111 [gzipped postscript].
• G. Pfister, T. Mora, C.Traverso An introduction to the tangent cone algorithm Issues in robotics and non-linear geometry, Advances in Computing Research Vol. 6, C. Hoffmann, ed., JAI Press, Greenwich Conn., 1992, 199-270 [gzipped postscript].
• T. Mora, Groebner bases in non-commutative algebras, Proc.ISSAC 88, LNCS 358 (1989), 150-161 [gzipped postscript].
• P. Gianni, T. Mora Algebraic solution of systems of polynomial equations using Groebner bases, AAECC5, LNCS 356 (1989), 247-257 [gzipped postscript].
• T. Mora, L. Robbiano, The Groebner fan of an ideal J. Symb. Comp.6 (1988) 183-208
• A. Miola, T. Mora Constructive lifting in graded structures: a unified view of Buchberger and Hensel methods, J. Symb. Comp 6 (1988) 305-322
• T. Mora Standard bases and non-noetherianity: non-commutative polynomial rings, Proc. AAECC4, LNCS 307 (1988), 98-109
• F. Mora, Groebner bases for non-commutative polynomial rings, Proc. AAECC3, LNCS 229 (1986) 353-362
• F. Mora An algorithmic approach to local rings Proc.EUROCAL'85,LNCS 204 (1985), 518-525
• F. Mora, H.M. Moeller, Computational aspects of reduction strategies to construct resolutions of monomial ideals, AAECC2, LNCS 228 (1986), 182-197
• F. Mora, H.M. Moeller Upper and lower bounds for the degree of Gr\"obner bases Proc.EUROSAM 84, LNCS 174 (1984) 172-183
• M.T. De Benedetti, F. Mora, G. Ucovich Polynomials of minimal degree and fixed period Proc.MIMI 84, 170-172
• F. Mora, H.M. Moeller New constructive methods in classical ideal theory J.Alg.100 (1986), 138-178
• F. Mora, H.M. Moeller The computation of the Hilbert function, Proc.EUROCAL 83, LNCS 162 (1983) 157-167
• F. Mora Classification of monomial curves Rend.Acad.Naz.XL 101 (1983) 13-28
• F. Mora A constructive characterization of standard bases BUMI,Sez.D 2(1983) 41-50
• F. Mora An algorithm to compute the equations of tangent cones Proc.EUROCAM 82, LNCS 144 (1982) 158-165
• F. Mora Computation of finite categories (1979)
• T. Mora (ed.), Proc. AAECC 6, Lect. N. Comp. Sci.356, Springer (1989)
• H. F. Mattson, T. Mora, (ed.), Proc. AAECC 7, Disc. Appl. Math. 33 (1991)
• C. Traverso, T. Mora (ed.),Effective Methods in Algebraic Geometry, Proc. MEGA '90, Birkhauser (1991)
• H. F. Mattson, T. Mora, T.R.N. Rao (ed.), Proc. AAECC 9 Lect. N. Comp. Sci. 539, Springer (1991)
• G. Cohen, , O. Moreno, T. Mora (ed.), Proc. AAECC 10 Lect. N. Comp. Sci. 673, Springer (1993)
• G. Cohen, M. Giusti, T. Mora (ed.), Proc. AAECC 11 Lect. N. Comp. Sci. 948, Springer (1995)
• H. F. Mattson, T. Mora (ed.), Proc. AAECC 12 Lect. N. Comp. Sci. 1255, Springer (1997)
• T. Mora (ed.), Proc. ISSAC'02, ACM (2002)
• M.Sala, T.Mora, C.Traverso, L.Perret, S.Sakata (eds.), Groebner Bases, Coding, and Cryptography. Springer (2009)

Back to previous page