Some of these references are not directly available yet.
	Please ask the author(s) for them by e-mail.
[Aldaz96] M. Aldaz Zaragüeta. Implementación de números racionales mediante la estructura de datos straight--line program. In M. Giusti, J. Heintz, and L. M. Pardo, editors, Proceedings of TERA'96, Santander, Spain, 1996. Universidad de Cantabria, Facultad de Ciencias.

[CaLlMa96a] B. Castaño, J. Llovet, and R. Martìnez. Polynomials, matrices and algorithms with straight--line programs. In J. Heintz, M. Giusti, and L. M. Pardo, editors, Proceedings of TERA'96, pages 12--14, Santander, Spain, April 1996. Universidad de Cantabria, Facultad de Ciencias.

[CaLlMa96b] B. Castaño, J. Llovet and R. Martìnez. An evaluation algorithm for univariate polynomials given by straight-line programs. preprint, Alcala, 17 pages, 1996.

[GiHePa96] M. Giusti, J. Heintz, and L. M. Pardo. TERA'96: Abstracts of the talks. Preprint Dep. Matemàticas, Estadìstica y Computaciòn. Universidad de Cantabria, 1996.

[GrHeMaSt96] A. Grosso, N. Herrera, G. Matera, M. E. Stefanoni, and J. M. Turull. Un algoritmo para el càlculo del rango de matrices enteras en espacio polilogarítmico. In Proc. 25th JAIIO, Buenos Aires, Argentina, 1996. (MS WORD)

[Haegele96a] K. Hägele. slp - a C++ classlib (A prototype for straight--line programs). Universidad de Cantabria, October 1996.

[Haegele96b] K. Hägele. Data structures and zero tests. In M. Giusti, J. Heintz, and L. M. Pardo, editors, Proceedings of TERA'96, page 20, Santander, Spain, April 1996. Universidad de Cantabria, Facultad de Ciencias.

[KrPa96] T. Krick and L. M. Pardo. A Computational Method for Diophantine Approximation. In L. Gonzalez-Vega and T. Recio, editors, Algorithms in Algebraic Geometry and Applications, volume 143 of Progress in Mathematics, pages 193--254. Birkhäuser Verlag, 1996. LM.

[MoMoPa96] J. L. Montaña, J. E. Morais, and L. M. Pardo. Lower Bounds for Arithmetic Networks II: Sum of Betti numbers. Applicable Algebra in Engineering Communications and Computing, vol.7, No. 1 (1996) 41-52.


Back to TERA Publications page Back to TERA Info page