Teo Mora - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2024

Towards a Gröbner-free approach to codingMichela Ceria, Teo Mora. dcc, 92(1):179-204, January 2024. [doi]

In memoriam Kai-Uwe SchmidtTeo Mora. aaecc, 35(2):119, 2024. [doi]

2023

Further perspectives on eliminationTeo Mora. aaecc, 34(5):745-749, September 2023. [doi]

2022

Degröbnerization: a political manifestoMichela Ceria, Samuel Lundqvist, Teo Mora. aaecc, 33(6):675-723, 2022. [doi]

2021

Why you cannot even hope to use Ore algebras in CryptographyMichela Ceria, Teo Mora, Andrea Visconti. aaecc, 32(3):229-244, 2021. [doi]

2020

Toward involutive bases over effective ringsMichela Ceria, Teo Mora. aaecc, 31(5-6):359-387, 2020. [doi]

HELP: a sparse error locator polynomial for BCH codesMichela Ceria, Teo Mora, Massimiliano Sala. aaecc, 31(3):215-233, 2020. [doi]

Special Issue: "Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography" ACA 2019, Montreal, Canada, July 16-20, 2019Kenza Guenda, Iiro S. Honkala, Ilias Kotsireas, Teo Mora, Qiang Wang. aaecc, 31(3):171-172, 2020. [doi]

Zacharias representation of effective associative ringsTeo Mora. JSC, 99:147-188, 2020. [doi]

2019

A general framework for Noetherian well ordered polynomial reductionsMichela Ceria, Teo Mora, Margherita Roggero. JSC, 95:100-133, 2019. [doi]

2018

Efficient Computation of Squarefree Separator PolynomialsMichela Ceria, Teo Mora, Andrea Visconti. icms 2018: 98-104 [doi]

2017

Buchberger-Weispfenning theory for effective associative ringsMichela Ceria, Teo Mora. JSC, 83:112-146, 2017. [doi]

2015

Term-ordering free involutive basesMichela Ceria, Teo Mora, Margherita Roggero. JSC, 68:87-108, 2015. [doi]

2009

Gröbner Bases over Commutative Rings and Applications to Coding TheoryEimear Byrne, Teo Mora. In Massimiliano Sala, Shojiro Sakata, Teo Mora, Carlo Traverso, Ludovic Perret, editors, Gröbner Bases, Coding, and Cryptography. pages 239-261, Springer, 2009. [doi]

The FGLM Problem and Möller's Algorithm on Zero-dimensional IdealsTeo Mora. In Massimiliano Sala, Shojiro Sakata, Teo Mora, Carlo Traverso, Ludovic Perret, editors, Gröbner Bases, Coding, and Cryptography. pages 27-45, Springer, 2009. [doi]

Gröbner TechnologyTeo Mora. In Massimiliano Sala, Shojiro Sakata, Teo Mora, Carlo Traverso, Ludovic Perret, editors, Gröbner Bases, Coding, and Cryptography. pages 11-25, Springer, 2009. [doi]

Decoding Cyclic Codes: the Cooper PhilosophyTeo Mora, Emmanuela Orsini. In Massimiliano Sala, Shojiro Sakata, Teo Mora, Carlo Traverso, Ludovic Perret, editors, Gröbner Bases, Coding, and Cryptography. pages 69-91, Springer, 2009. [doi]

2008

Invited Talk: Decoding Cyclic Codes: The Cooper PhilosophyTeo Mora, Emmanuela Orsini. mmics 2008: 126-127 [doi]

2006

The big Mother of all dualities 2: Macaulay basesMaria Emilia Alonso, Maria Grazia Marinari, Teo Mora. aaecc, 17(6):409-451, 2006. [doi]

2005

Rambling on Weispfenning, Montes, Gianni, and KroneckerMaria Grazia Marinari, Teo Mora. BIRTHDAY 2005: 167-172

2003

On the Gröbner bases of some symmetric systems and their application to coding theoryTeo Mora, Massimiliano Sala. JSC, 35(2):177-194, 2003. [doi]

2002

The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape TheoremMassimo Caboara, Teo Mora. aaecc, 13(3):209-232, 2002. [doi]

2000

Computing Gröbner Bases by FGLM Techniques in a Non-commutative SettingMiguel A. Borges-Trenard, Mijail Borges-Quintana, Teo Mora. JSC, 30(4):429-449, 2000.

1998

A Note on Nielsen Reduction and Coset EnumerationBirgit Reinert, Klaus Madlener, Teo Mora. issac 1998: 171-178 [doi]

1995

Gröbner Duality and Multiplicities in Polynomial System SolvingMaria Grazia Marinari, Teo Mora, H. Michael Möller. issac 1995: 167-179 [doi]

1994

The Shape of the Shape LemmaEberhard Becker, Teo Mora, Maria Grazia Marinari, Carlo Traverso. issac 1994: 129-133 [doi]

Implicitization of Hypersurfaces and Curves by the Primbasissatz and Basis ConversionSandra Licciardi, Teo Mora. issac 1994: 191-196 [doi]

An Introduction to Commutative and Noncommutative Gröbner BasesTeo Mora. TCS, 134(1):131-173, 1994.

1993

The Virtues of Laziness: Complexity of the Tangent Cone AlgorithmAbdallah Assi, Teo Mora. aaecc, 4:231-238, 1993.

Efficient Computation of Zero-Dimensional Gröbner Bases by Change of OrderingJean-Charles Faugère, Patrizia M. Gianni, Daniel Lazard, Teo Mora. JSC, 16(4):329-344, 1993.

Gröbner Bases of Ideals Defined by Functionals with an Application to Ideals of Projective PointsMaria Grazia Marinari, H. Michael Möller, Teo Mora. aaecc, 4:103-145, 1993.

1992

Gröbner Bases Computation Using SyzygiesH. Michael Möller, Teo Mora, Carlo Traverso. issac 1992: 320-328 [doi]

1991

One Sugar cube, Please or Selection Strategies in the Buchberger AlgorithmAlessandro Giovini, Teo Mora, Gianfranco Niesi, Lorenzo Robbiano, Carlo Traverso. issac 1991: 49-54 [doi]

Gröbner Bases of Ideals Given by Dual BasesMaria Grazia Marinari, H. Michael Möller, Teo Mora. issac 1991: 55-63 [doi]

La queste del saint Gr::a::(AL): A computational approach to local algebraTeo Mora. DAM, 33(1-3):161-190, 1991. [doi]

1990

Local Decomposition AlgorithmsMaria Emilia Alonso, Teo Mora, Mario Raimondo. AAECC 1991: 208-221

On the Complexity of Algebraic Power SeriesMaria Emilia Alonso, Teo Mora, Mario Raimondo. AAECC 1991: 197-207

1989

Computing with Algebraic SeriesMaria Emilia Alonso, Teo Mora, Mario Raimondo. issac 1989: 101-111 [doi]

1988

Constructive Lifting in Graded Structures: A Unified View of Buchberger and Hensel MethodsAlfonso Miola, Teo Mora. JSC, 6(2/3):305-322, 1988.

The Gröbner Fan of an IdealTeo Mora, Lorenzo Robbiano. JSC, 6(2/3):183-208, 1988.

Groebner Bases in Non-Commutative AlgebrasTeo Mora. issac 1989: 150-161

1987

Symbolic and algebraic computation research in ItalyPatrizia M. Gianni, Alfonso Miola, Teo Mora. cca, 21(2):8-15, 1987. [doi]

Algebraic Solution of Systems of Polynomial Equations Using Groebner BasesPatrizia M. Gianni, Teo Mora. AAECC 1989: 247-257

1986

Standard Bases and Non-Noetherianity: Non-Commutative Polynomial RingsTeo Mora. AAECC 1988: 98-109

Sign in or sign up to see more results.

runs on WebDSL