Publicaciones

• Armendáriz I. & Solernó P.: On the computation of the radical of polynomial complete intersection ideals.- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, L.N.Comp.Sci. 948, Springer Verlag (1995) 106-119.
• Bank B., Giusti M., Heintz J., Mandel R. & Mbakop G.: Polar Varieties and Efficient Real Equation Solving: The Hypersurface Case.- Aparecerá en Approximation and Optimization 9, Ed. Universitaria de Puebla, México.
• Bank B., Giusti M., Heintz J. & Mbakop G.: Polar Varieties, Real Equation Solving and Data-Structures: The Hypersurface Case.- Aparecerá en J. of Complexity (1996).
• Fitchas N. Grupo de investigación dirigido por J. Heintz. En este trabajo participaron J. Heintz, Luis Pardo, Juan Sabia y Pablo Solernó., Giusti M., Smietanski G.: Sur la complexité du théoreme des zéros.- Approximation and Optimization 8, ed. J. Guddat et al., Peter Lange Verlag, Frankfurt am Main (1995) 274-329.
• Giusti M., Heintz J., Morais J., Pardo L.: When polynomial equation systems can be `solved' fast?.- Applied Algebra, Algebraic Algorithms and Error Correcting Codes. L.N.Comp.Sci. 948, Springer Verlag (1995) 205-231.
• Giusti M., Haëgele K., Heintz J., Morais J., Pardo L.: Lower Bounds for Diophantine Approximation.- Aparecerá en J. of Pure and Appl. Algebra (1996).
• Giusti M., Heintz J., Morais J., Morgenstern J., Pardo L.: Straight-line programs in geometric elimination theory.- Aparecerá en J. of Pure and Appl. Algebra (1996).
• Grosso A., Herrera N., Matera G., Stefanoni M.E., Turull J. M.: A PSPACE implementation of the effective Nullstellensatz.- Proc. JAIIO, Buenos Aires, (1996).
• Krick T. & Pardo L.M.: A Computational Method for Diophantine Approximation.- Algorithms in Algebraic Geometry and Applications, Progress in Mathematics 143, Birkhäuser Verlag (1996) 193-254.
• Krick T., Sabia J. & Solernó P.: On intrinsic Bounds in the Nullstellesatz.- Aparecerá en AAECC Journal, 1997.
• Matera G.: Integration of multivariate rational functions given by straight-line programs.- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, L.N.Comp.Sci. 948, Springer Verlag (1995) 347-364.
• Matera G. & Turull J.: The space complexity of elimination theory.- Aparecerá en Proc. Foundations of Computational Mathematics FOCM'97, 1997.
• Puddu S. & Sabia J.: An effective algorithm for quantifier elimination over algebraically closed fields using straight-line programs.- Aparecerá en J. of Pure and Appl. Algebra, 1997.
• Sabia J. & Solernó P.: Bounds for Traces in Complete Intersections and Degrees in the Nullstellensatz.- AAECC Journal 6, No.6, Springer-Verlag (1995) 353-376.
• Solernó P.: Complexity bounds in elimination theory.- Mathematics and Computers in Simulation 1308, North Holland, Elsevier (1996) 1-10.
• Sombra M.: Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nulstellen- satz.- Aparecerá en J. Pure and Appl. Algebra, 1997.
• Turull J. M.: Distinguishability, query computability and relational machines.- Proceedings X Latin American Symposium on Mathematical Logic (1995).
• Turull J. M.: Partial distinguishability and Query computability on Finite Structures.- Aparecerá en Proc. XI Encuentro Brasileño de Lógica, 1996.