Standard Bases and Non-Noetherianity: Non-Commutative Polynomial Rings. - Teo Mora (AAECC, 1986)

Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases. - Patrizia M. Gianni; Teo Mora (AAECC, 1987)

Symbolic and algebraic computation research in Italy. - Patrizia M. Gianni; Alfonso Miola; Teo Mora (SIGSAM Bull., 1987)

Groebner Bases in Non-Commutative Algebras. - Teo Mora (ISSAC, 1988)

Constructive Lifting in Graded Structures: A Unified View of Buchberger and Hensel Methods. - Alfonso Miola; Teo Mora (J. Symb. Comput., 1988)

The Gröbner Fan of an Ideal. - Teo Mora; Lorenzo Robbiano (J. Symb. Comput., 1988)

Computing with Algebraic Series. - Maria Emilia Alonso; Teo Mora; Mario Raimondo (ISSAC, 1989)

On the Complexity of Algebraic Power Series. - Maria Emilia Alonso; Teo Mora; Mario Raimondo (AAECC, 1990)

Local Decomposition Algorithms. - Maria Emilia Alonso; Teo Mora; Mario Raimondo (AAECC, 1990)

"One Sugar cube, Please" or Selection Strategies in the Buchberger Algorithm. - Alessandro Giovini; Teo Mora; Gianfranco Niesi; Lorenzo Robbiano; Carlo Traverso (ISSAC, 1991)

Gröbner Bases of Ideals Given by Dual Bases. - Maria Grazia Marinari; H. Michael Möller; Teo Mora (ISSAC, 1991)

Preface. - H. F. Mattson Jr.; Teo Mora (Discret. Appl. Math., 1991)

La queste del saint Gra(AL): A computational approach to local algebra. - Teo Mora (Discret. Appl. Math., 1991)

Gröbner Bases Computation Using Syzygies. - H. Michael Möller; Teo Mora; Carlo Traverso (ISSAC, 1992)

The Virtues of Laziness: Complexity of the Tangent Cone Algorithm. - Abdallah Assi; Teo Mora (Appl. Algebra Eng. Commun. Comput., 1993)

Gröbner Bases of Ideals Defined by Functionals with an Application to Ideals of Projective Points. - Maria Grazia Marinari; H. Michael Möller; Teo Mora (Appl. Algebra Eng. Commun. Comput., 1993)

Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. - Jean-Charles Faugère; Patrizia M. Gianni; Daniel Lazard; Teo Mora (J. Symb. Comput., 1993)

The Shape of the Shape Lemma. - Eberhard Becker; Teo Mora; Maria Grazia Marinari; Carlo Traverso (ISSAC, 1994)

Implicitization of Hypersurfaces and Curves by the Primbasissatz and Basis Conversion. - Sandra Licciardi; Teo Mora (ISSAC, 1994)

An Introduction to Commutative and Noncommutative Gröbner Bases. - Teo Mora (Theor. Comput. Sci., 1994)

Gröbner Duality and Multiplicities in Polynomial System Solving. - Maria Grazia Marinari; Teo Mora; H. Michael Möller (ISSAC, 1995)

A Note on Nielsen Reduction and Coset Enumeration. - Birgit Reinert; Klaus Madlener; Teo Mora (ISSAC, 1998)

Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting. - Miguel A. Borges-Trenard; Mijail Borges-Quintana; Teo Mora (J. Symb. Comput., 2000)

The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape Theorem. - Massimo Caboara; Teo Mora (Appl. Algebra Eng. Commun. Comput., 2002)

On the Gröbner bases of some symmetric systems and their application to coding theory. - Teo Mora; Massimiliano Sala (J. Symb. Comput., 2003)

Rambling on Weispfenning, Montes, Gianni, and Kronecker. - Maria Grazia Marinari; Teo Mora (Algorithmic Algebra and Logic, 2005)

The big Mother of all dualities 2: Macaulay bases. - Maria Emilia Alonso; Maria Grazia Marinari; Teo Mora (Appl. Algebra Eng. Commun. Comput., 2006)

Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy. - Teo Mora; Emmanuela Orsini (MMICS, 2008)

Gröbner Bases over Commutative Rings and Applications to Coding Theory. - Eimear Byrne; Teo Mora (Gröbner Bases, Coding, and Cryptography, 2009)

Gröbner Technology. - Teo Mora (Gröbner Bases, Coding, and Cryptography, 2009)

The FGLM Problem and Möller's Algorithm on Zero-dimensional Ideals. - Teo Mora (Gröbner Bases, Coding, and Cryptography, 2009)

Decoding Cyclic Codes: the Cooper Philosophy. - Teo Mora; Emmanuela Orsini (Gröbner Bases, Coding, and Cryptography, 2009)

A unifying form for noetherian polynomial reductions. - Michela Ceria; Teo Mora; Margherita Roggero (CoRR, 2015)

Term-ordering free involutive bases. - Michela Ceria; Teo Mora; Margherita Roggero (J. Symb. Comput., 2015)

An algorithmic approach using multivariate polynomials for the nonlinearity of Boolean functions. - Emanuele Bellini 002; Teo Mora; Massimiliano Sala (CoRR, 2016)

Buchberger-Weispfenning theory for effective associative rings. - Michela Ceria; Teo Mora (J. Symb. Comput., 2017)

Efficient Computation of Squarefree Separator Polynomials. - Michela Ceria; Teo Mora; Andrea Visconti (ICMS, 2018)

A general framework for Noetherian well ordered polynomial reductions. - Michela Ceria; Teo Mora; Margherita Roggero (J. Symb. Comput., 2019)

Toward involutive bases over effective rings. - Michela Ceria; Teo Mora (Appl. Algebra Eng. Commun. Comput., 2020)

HELP: a sparse error locator polynomial for BCH codes. - Michela Ceria; Teo Mora; Massimiliano Sala (Appl. Algebra Eng. Commun. Comput., 2020)

Special Issue: "Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography" ACA 2019, Montreal, Canada, July 16-20, 2019. - Kenza Guenda; Iiro S. Honkala; Ilias S. Kotsireas; Teo Mora; Qiang Wang 012 (Appl. Algebra Eng. Commun. Comput., 2020)

Zacharias representation of effective associative rings. - Teo Mora (J. Symb. Comput., 2020)

Why you cannot even hope to use Ore algebras in Cryptography. - Michela Ceria; Teo Mora; Andrea Visconti (Appl. Algebra Eng. Commun. Comput., 2021)

Degröbnerization: a political manifesto. - Michela Ceria; Samuel Lundqvist; Teo Mora (Appl. Algebra Eng. Commun. Comput., 2022)

Further perspectives on elimination. - Teo Mora (Appl. Algebra Eng. Commun. Comput., 2023)

In memoriam Kai-Uwe Schmidt. - Teo Mora (Appl. Algebra Eng. Commun. Comput., 2024)

Towards a Gröbner-free approach to coding. - Michela Ceria; Teo Mora (Des. Codes Cryptogr., 2024)

Correction: In memoriam Kai-Uwe Schmidt. - Teo Mora (Appl. Algebra Eng. Commun. Comput., 2025)