1. On computing the determinant in small parallel time using a small number of processors;Berkowitz, Stuart J.;Inform. Process. Lett.,1984
2. Sur le degré des relations entre polynômes;Briançon, Joël;C. R. Acad. Sci. Paris Sér. I Math.,1983
3. [Buc65] Buchberger, B. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph.D. Dissertation, U. Innsbruck, Austria (1965)
4. [CLO15] Cox, David A.; Little, John; O’Shea, Donal Ideals, varieties, and algorithms, Undergraduate Texts in Math., Springer, Cham, 2015 (An introduction to computational algebraic geometry and commutative algebra)
5. Le théorème de complexité de Mayr et Meyer;Demazure, M.;Géométrie algébrique et applications, I (La Rábida, 1984),1987