Teo Mora

Orcid: 0000-0001-8176-4368

According to our database1, Teo Mora authored at least 47 papers between 1986 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Towards a Gröbner-free approach to coding.
Des. Codes Cryptogr., January, 2024

In memoriam Kai-Uwe Schmidt.
Appl. Algebra Eng. Commun. Comput., 2024

2023
Further perspectives on elimination.
Appl. Algebra Eng. Commun. Comput., September, 2023

2022
Degröbnerization: a political manifesto.
Appl. Algebra Eng. Commun. Comput., 2022

2021
Why you cannot even hope to use Ore algebras in Cryptography.
Appl. Algebra Eng. Commun. Comput., 2021

2020
Zacharias representation of effective associative rings.
J. Symb. Comput., 2020

Special Issue: "Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography" ACA 2019, Montreal, Canada, July 16-20, 2019.
Appl. Algebra Eng. Commun. Comput., 2020

HELP: a sparse error locator polynomial for BCH codes.
Appl. Algebra Eng. Commun. Comput., 2020

Toward involutive bases over effective rings.
Appl. Algebra Eng. Commun. Comput., 2020

2019
A general framework for Noetherian well ordered polynomial reductions.
J. Symb. Comput., 2019

2018
Efficient Computation of Squarefree Separator Polynomials.
Proceedings of the Mathematical Software - ICMS 2018, 2018

2017
Buchberger-Weispfenning theory for effective associative rings.
J. Symb. Comput., 2017

2016
An algorithmic approach using multivariate polynomials for the nonlinearity of Boolean functions.
CoRR, 2016

2015
Term-ordering free involutive bases.
J. Symb. Comput., 2015

A unifying form for noetherian polynomial reductions.
CoRR, 2015

2009
Decoding Cyclic Codes: the Cooper Philosophy.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

The FGLM Problem and Möller's Algorithm on Zero-dimensional Ideals.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

Gröbner Technology.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

Gröbner Bases over Commutative Rings and Applications to Coding Theory.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy.
Proceedings of the Mathematical Methods in Computer Science, 2008

2006
The big Mother of all dualities 2: Macaulay bases.
Appl. Algebra Eng. Commun. Comput., 2006

2005
Rambling on Weispfenning, Montes, Gianni, and Kronecker.
Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2003
On the Gröbner bases of some symmetric systems and their application to coding theory.
J. Symb. Comput., 2003

2002
The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape Theorem.
Appl. Algebra Eng. Commun. Comput., 2002

2000
Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting.
J. Symb. Comput., 2000

1998
A Note on Nielsen Reduction and Coset Enumeration.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1995
Gröbner Duality and Multiplicities in Polynomial System Solving.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994
An Introduction to Commutative and Noncommutative Gröbner Bases.
Theor. Comput. Sci., 1994

Implicitization of Hypersurfaces and Curves by the Primbasissatz and Basis Conversion.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

The Shape of the Shape Lemma.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993
Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering.
J. Symb. Comput., 1993

Gröbner Bases of Ideals Defined by Functionals with an Application to Ideals of Projective Points.
Appl. Algebra Eng. Commun. Comput., 1993

The Virtues of Laziness: Complexity of the Tangent Cone Algorithm.
Appl. Algebra Eng. Commun. Comput., 1993

1992
Gröbner Bases Computation Using Syzygies.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991
La queste del saint Gr<sub>a</sub>(AL): A computational approach to local algebra.
Discret. Appl. Math., 1991

Preface.
Discret. Appl. Math., 1991

Gröbner Bases of Ideals Given by Dual Bases.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

"One Sugar cube, Please" or Selection Strategies in the Buchberger Algorithm.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990
Local Decomposition Algorithms.
Proceedings of the Applied Algebra, 1990

On the Complexity of Algebraic Power Series.
Proceedings of the Applied Algebra, 1990

1989
Computing with Algebraic Series.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988
The Gröbner Fan of an Ideal.
J. Symb. Comput., 1988

Constructive Lifting in Graded Structures: A Unified View of Buchberger and Hensel Methods.
J. Symb. Comput., 1988

Groebner Bases in Non-Commutative Algebras.
Proceedings of the Symbolic and Algebraic Computation, 1988

1987
Symbolic and algebraic computation research in Italy.
SIGSAM Bull., 1987

Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases.
Proceedings of the Applied Algebra, 1987

1986
Standard Bases and Non-Noetherianity: Non-Commutative Polynomial Rings.
Proceedings of the Applied Algebra, 1986


  Loading...