1. D. Bayer, M. Stillman, A theorem on refining division orders by the reverse lexicographic order, Lecture Notes for the meeting on Algebraic Geometry and Computing, 1985, Trento, Italy.
2. S. J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Information Processing Letters 18 (1984), 147–150.
3. W. S. Brown, On Euclid’s algorithm and the computation of polynomial greatest common divisors, J. ACM 18 (1971), 478–504.
4. D. Brownawell, Bounds for the degree in the Nullstellensatz, Ann. Math. 126 (1987), 577–591.
5. L. Caniglia, Complejidad de algoritmos en geometria computational, Thèse, Universidad de Buenos Aires 1989.