Some of these references are not directly available yet.
	Please ask the author(s) for them by e-mail.

[CuMoPa95] F. Cucker, J. L. Montaña, and L. M. Pardo. Models for parallel computation with real numbers. In A. J. van der Poorten, I. Shparlinski, and H. G. Zimmer, editors, Number Theoretic and Algebraic Methods in Computer Science Word Scientific, (1995) 53--63.

[FiGiSm95] N. Fitchas, M. Giusti, and F. Smietanski. Sur la Complexité du Théorème des Zéros. In J. Guddat et al., editor, Approximation and Optimization in the Caribbean II, Proc. 2nd Int. Conf. on Non-Linear Optimization and Approximation, volume 8 of Approximation and Optimization, pages 247--329. Peter Lange Verlag, Frankfurt am Main, 1995.

[GiHeMoPa95] M. Giusti, J. Heintz, J. E. Morais, and L. M. Pardo. When polynomial equation system can be "solved" fast?. In G.Cohen, H. Giusti, and T. Mora, editors, Applied Algebra, Algebraic Algorithms and Error Corecting Codes, Proc. AAECC-11, LNCS 948 , Springer Verlag (1995) 205--231.

[Matera95] G. Matera. Integration of multivariate rational functions given by straight-line programs. In G.Cohen, H. Giusti, and T. Mora, editors, Applied Algebra, Algebraic Algorithms and Error Corecting Codes, Proc. AAECC-11, volume 948 of LNCS, pp. 347-364. Springer, 1995.

[Pardo95] Luis M. Pardo. How Lower and Upper Complexity Bounds meet in Elimination Theory. In G.Cohen, H. Giusti, and T. Mora, editors, Applied Algebra, Algebraic Algorithms and Error Corecting Codes, Proc. AAECC-11, volume 948 of LNCS. Springer (1995).