Teo Mora - RankMe

55 papers B 10Journal 28Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Correction: In memoriam Kai-Uwe Schmidt. Appl. Algebra Eng. Commun. Comput. Teo Mora
2024	J	`jnl`	In memoriam Kai-Uwe Schmidt. Appl. Algebra Eng. Commun. Comput. Teo Mora
2024	J	`jnl`	Towards a Gröbner-free approach to coding. Des. Codes Cryptogr. Michela Ceria, Teo Mora
2023	J	`jnl`	Further perspectives on elimination. Appl. Algebra Eng. Commun. Comput. Teo Mora
2022	J	`jnl`	Degröbnerization: a political manifesto. Appl. Algebra Eng. Commun. Comput. Michela Ceria, Samuel Lundqvist, Teo Mora
2021	J	`jnl`	Why you cannot even hope to use Ore algebras in Cryptography. Appl. Algebra Eng. Commun. Comput. Michela Ceria, Teo Mora, Andrea Visconti
2020	J	`jnl`	HELP: a sparse error locator polynomial for BCH codes. Appl. Algebra Eng. Commun. Comput. Michela Ceria, Teo Mora, Massimiliano Sala
2020	J	`jnl`	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. Kenza Guenda, Iiro S. Honkala, Ilias S. Kotsireas, Teo Mora, Qiang Wang
2020	J	`jnl`	Toward involutive bases over effective rings. Appl. Algebra Eng. Commun. Comput. Michela Ceria, Teo Mora
2020	J	`jnl`	Zacharias representation of effective associative rings. J. Symb. Comput. Teo Mora
2019	J	`jnl`	A general framework for Noetherian well ordered polynomial reductions. J. Symb. Comput. Michela Ceria, Teo Mora, Margherita Roggero
2018	—	`conf`	Efficient Computation of Squarefree Separator Polynomials. ICMS Michela Ceria, Teo Mora, Andrea Visconti
2017	J	`jnl`	Buchberger-Weispfenning theory for effective associative rings. J. Symb. Comput. Michela Ceria, Teo Mora
2016	J	`jnl`	An algorithmic approach using multivariate polynomials for the nonlinearity of Boolean functions. CoRR Emanuele Bellini, Teo Mora, Massimiliano Sala
2015	J	`jnl`	A unifying form for noetherian polynomial reductions. CoRR Michela Ceria, Teo Mora, Margherita Roggero
2015	J	`jnl`	Term-ordering free involutive bases. J. Symb. Comput. Michela Ceria, Teo Mora, Margherita Roggero
2009	—	`ch.`	Decoding Cyclic Codes: the Cooper Philosophy. Gröbner Bases, Coding, and Cryptography Teo Mora, Emmanuela Orsini
2009	—	`ch.`	Gröbner Bases over Commutative Rings and Applications to Coding Theory. Gröbner Bases, Coding, and Cryptography Eimear Byrne, Teo Mora
2009	—	`book`	Gröbner Bases, Coding, and Cryptography Massimiliano Sala, Shojiro Sakata, Teo Mora, Carlo Traverso, Ludovic Perret
2009	—	`ch.`	Gröbner Technology. Gröbner Bases, Coding, and Cryptography Teo Mora
2009	—	`ch.`	The FGLM Problem and Möller's Algorithm on Zero-dimensional Ideals. Gröbner Bases, Coding, and Cryptography Teo Mora
2008	—	`conf`	Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy. MMICS Teo Mora, Emmanuela Orsini
2006	J	`jnl`	The big Mother of all dualities 2: Macaulay bases. Appl. Algebra Eng. Commun. Comput. Maria Emilia Alonso, Maria Grazia Marinari, Teo Mora
2005	—	`conf`	Rambling on Weispfenning, Montes, Gianni, and Kronecker. Algorithmic Algebra and Logic Maria Grazia Marinari, Teo Mora
2003	J	`jnl`	On the Gröbner bases of some symmetric systems and their application to coding theory. J. Symb. Comput. Teo Mora, Massimiliano Sala
2002	B	`ed.`	Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings ISSAC Teo Mora
2002	J	`jnl`	The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape Theorem. Appl. Algebra Eng. Commun. Comput. Massimo Caboara, Teo Mora
2000	J	`jnl`	Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting. J. Symb. Comput. Miguel A. Borges-Trenard, Mijail Borges-Quintana, Teo Mora
1998	B	`conf`	A Note on Nielsen Reduction and Coset Enumeration. ISSAC Birgit Reinert, Klaus Madlener, Teo Mora
1997	—	`ed.`	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 12th International Symposium, AAECC-12, Toulouse, France, June 23-27, 1997, Proceedings AAECC Teo Mora, Harold F. Mattson
1995	—	`ed.`	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995, Proceedings AAECC Gérard D. Cohen, Marc Giusti, Teo Mora
1995	B	`conf`	Gröbner Duality and Multiplicities in Polynomial System Solving. ISSAC Maria Grazia Marinari, Teo Mora, H. Michael Möller
1994	J	`jnl`	An Introduction to Commutative and Noncommutative Gröbner Bases. Theor. Comput. Sci. Teo Mora
1994	B	`conf`	Implicitization of Hypersurfaces and Curves by the Primbasissatz and Basis Conversion. ISSAC Sandra Licciardi, Teo Mora
1994	B	`conf`	The Shape of the Shape Lemma. ISSAC Eberhard Becker, Teo Mora, Maria Grazia Marinari, Carlo Traverso
1993	—	`ed.`	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993, Proceedings AAECC Gérard D. Cohen, Teo Mora, Oscar Moreno
1993	J	`jnl`	Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. J. Symb. Comput. Jean-Charles Faugère, Patrizia M. Gianni, Daniel Lazard, Teo Mora
1993	J	`jnl`	Gröbner Bases of Ideals Defined by Functionals with an Application to Ideals of Projective Points. Appl. Algebra Eng. Commun. Comput. Maria Grazia Marinari, H. Michael Möller, Teo Mora
1993	J	`jnl`	The Virtues of Laziness: Complexity of the Tangent Cone Algorithm. Appl. Algebra Eng. Commun. Comput. Abdallah Assi, Teo Mora
1992	B	`conf`	Gröbner Bases Computation Using Syzygies. ISSAC H. Michael Möller, Teo Mora, Carlo Traverso
1991	B	`conf`	"One Sugar cube, Please" or Selection Strategies in the Buchberger Algorithm. ISSAC Alessandro Giovini, Teo Mora, Gianfranco Niesi, Lorenzo Robbiano, Carlo Traverso
1991	—	`ed.`	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991, Proceedings AAECC Harold F. Mattson, Teo Mora, T. R. N. Rao
1991	B	`conf`	Gröbner Bases of Ideals Given by Dual Bases. ISSAC Maria Grazia Marinari, H. Michael Möller, Teo Mora
1991	J	`jnl`	La queste del saint Gr Discret. Appl. Math. Teo Mora
1991	J	`jnl`	Preface. Discret. Appl. Math. H. F. Mattson Jr., Teo Mora
1990	—	`conf`	Local Decomposition Algorithms. AAECC Maria Emilia Alonso, Teo Mora, Mario Raimondo
1990	—	`conf`	On the Complexity of Algebraic Power Series. AAECC Maria Emilia Alonso, Teo Mora, Mario Raimondo
1989	—	`ed.`	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988, Proceedings AAECC Teo Mora
1989	B	`conf`	Computing with Algebraic Series. ISSAC Maria Emilia Alonso, Teo Mora, Mario Raimondo
1988	J	`jnl`	Constructive Lifting in Graded Structures: A Unified View of Buchberger and Hensel Methods. J. Symb. Comput. Alfonso Miola, Teo Mora
1988	B	`conf`	Groebner Bases in Non-Commutative Algebras. ISSAC Teo Mora
1988	J	`jnl`	The Gröbner Fan of an Ideal. J. Symb. Comput. Teo Mora, Lorenzo Robbiano
1987	—	`conf`	Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases. AAECC Patrizia M. Gianni, Teo Mora
1987	J	`jnl`	Symbolic and algebraic computation research in Italy. SIGSAM Bull. Patrizia M. Gianni, Alfonso Miola, Teo Mora
1986	—	`conf`	Standard Bases and Non-Noetherianity: Non-Commutative Polynomial Rings. AAECC Teo Mora