J.C. Faugère; P. Gianni; D. Lazard; T. Mora (1993). "Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering". Journal of Symbolic Computation. 16 (4): 329–344. doi:10.1006/jsco.1993.1051. https://doi.org/10.1006%2Fjsco.1993.1051
Middeke, Johannes (2012-01-01). "A Computational View on Normal Forms of Matrices of Ore Polynomials". ACM Commun. Comput. Algebra. 45 (3/4): 190–191. doi:10.1145/2110170.2110182. ISSN 1932-2240. S2CID 14396484. /wiki/Doi_(identifier)
Gerdt, V. P.; Yanovich, D. A. (2003-03-01). "Implementation of the FGLM Algorithm and Finding Roots of Polynomial Involutive Systems". Programming and Computer Software. 29 (2): 72–74. doi:10.1023/A:1022992514981. ISSN 0361-7688. S2CID 17851647. /wiki/Doi_(identifier)
Faugère, Jean-Charles; Mou, Chenqi (2017-05-01). "Sparse FGLM algorithms". Journal of Symbolic Computation. 80, Part 3: 538–569. arXiv:1304.1238. doi:10.1016/j.jsc.2016.07.025. S2CID 149627. /wiki/ArXiv_(identifier)
Licciardi, Sandra; Mora, Teo (1994-01-01). "Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion". Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94. New York, NY, USA: ACM. pp. 191–196. doi:10.1145/190347.190416. ISBN 978-0897916387. S2CID 14584685. 978-0897916387
Borges-Quintana, M.; Borges-Trenard, M. A.; Martínez-Moro, E. (2006-02-20). "A General Framework for Applying FGLM Techniques to Linear Codes". Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Lecture Notes in Computer Science. Vol. 3857. pp. 76–86. arXiv:math/0509186. doi:10.1007/11617983_7. ISBN 978-3-540-31423-3. S2CID 13427304. 978-3-540-31423-3