Integration of Multivariate Rational Functions Given by Straight-Line Programs. - Guillermo Matera (AAECC, 1995)

Combinatorial Hardness Proofs for Polynomial Evaluation. - Mikel Aldaz; Joos Heintz; Guillermo Matera; José Luis Montaña; Luis Miguel Pardo (MFCS, 1998)

OpTERA - Optimization and Real Equation Solving. - Bernd Bank; Joos Heintz; Lutz Lehmann; Guillermo Matera; Guy M. Mbakop; Rosita Wachenchauzer; Ariel Waissbein (German-Argentinian Workshop on Information Technology, 1999)

Probabilistic Algorithms for Geometric Elimination. - Guillermo Matera (Appl. Algebra Eng. Commun. Comput., 1999)

Time-Space Tradeoffs in Algebraic Complexity Theory. - Mikel Aldaz; Joos Heintz; Guillermo Matera; José Luis Montaña; Luis Miguel Pardo (J. Complex., 2000)

On the Time-Space Complexity of Geometric Elimination Procedures. - Joos Heintz; Guillermo Matera; Ariel Waissbein (Appl. Algebra Eng. Commun. Comput., 2001)

A new method to obtain lower bounds for polynomial evaluation. - Mikel Aldaz; Guillermo Matera; José Luis Montaña; Luis Miguel Pardo (Theor. Comput. Sci., 2001)

The differential Hilbert function of a differential rational mapping can be computed in polynomial time. - Guillermo Matera; Alexandre Sedoglavic (ISSAC, 2002)

Functional programming concepts and straight-line programs in computer algebra. - N. Bruno; Joos Heintz; Guillermo Matera; Rosita Wachenchauzer (Math. Comput. Simul., 2002)

The Hardness of Polynomial Equation Solving. - David Castro 007; Marc Giusti; Joos Heintz; Guillermo Matera; Luis Miguel Pardo (Found. Comput. Math., 2003)

Fast computation of discrete invariants associated to a differential rational mapping. - Guillermo Matera; Alexandre Sedoglavic (J. Symb. Comput., 2003)

Polynomial equation solving by lifting procedures for ramified fibers. - Agustín Bompadre; Guillermo Matera; Rosita Wachenchauzer; Ariel Waissbein (Theor. Comput. Sci., 2004)

Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study. - Mariano De Leo; Ezequiel Dratman; Guillermo Matera (J. Complex., 2005)

Inverting bijective polynomial maps over finite fields. - Antonio Cafure; Guillermo Matera; Ariel Waissbein (ITW, 2006)

Improved explicit estimates on the number of solutions of equations over a finite field. - Antonio Cafure; Guillermo Matera (Finite Fields Their Appl., 2006)

Fast computation of a rational point of a variety over a finite field. - Antonio Cafure; Guillermo Matera (Math. Comput., 2006)

Robust Algorithms For Generalized Pham Systems. - Ezequiel Dratman; Guillermo Matera; Ariel Waissbein (Comput. Complex., 2009)

On the solution of the polynomial systems arising in the discretization of certain ODEs. - Ezequiel Dratman; Guillermo Matera (Computing, 2009)

Deformation Techniques for Sparse Systems. - Gabriela Jeronimo; Guillermo Matera; Pablo Solernó; Ariel Waissbein (Found. Comput. Math., 2009)

Lower complexity bounds for interpolation algorithms. - Nardo Giménez; Joos Heintz; Guillermo Matera; Pablo Solernó (J. Complex., 2011)

Singularities of symmetric hypersurfaces and Reed-Solomon codes. - Antonio Cafure; Guillermo Matera; Melina Privitelli (Adv. Math. Commun., 2012)

On the value set of small families of polynomials over a finite field, I. - Eda Cesaratto; Guillermo Matera; Mariana Pérez; Melina Privitelli (J. Comb. Theory A, 2014)

Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field. - Antonio Cafure; Guillermo Matera; Melina Privitelli (Finite Fields Their Appl., 2015)

Degeneracy Loci and Polynomial Equation Solving. - Bernd Bank; Marc Giusti; Joos Heintz; Grégoire Lecerf; Guillermo Matera; Pablo Solernó (Found. Comput. Math., 2015)

Quiz games as a model for information hiding. - Bernd Bank; Joos Heintz; Guillermo Matera; José Luis Montaña; Luis M. Pardo; Andres Rojas Paredes (J. Complex., 2016)

Newton's method and a mesh-independence principle for certain semilinear boundary-value problems. - Ezequiel Dratman; Guillermo Matera (J. Comput. Appl. Math., 2016)

The distribution of factorization patterns on linear families of polynomials over a finite field. - Eda Cesaratto; Guillermo Matera; Mariana Pérez (Comb., 2017)

On the computation of rational points of a hypersurface over a finite field. - Guillermo Matera; Mariana Pérez; Melina Privitelli (J. Complex., 2017)

On the bit complexity of polynomial system solving. - Nardo Giménez; Guillermo Matera (J. Complex., 2019)

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field. - Nardo Giménez; Guillermo Matera; Mariana Pérez; Melina Privitelli (Comb. Probab. Comput., 2022)

Shifted varieties and discrete neighborhoods around varieties. - Joachim von zur Gathen; Guillermo Matera (J. Symb. Comput., 2022)

On the computation of rational solutions of underdetermined systems over a finite field. - Nardo Giménez; Guillermo Matera; Mariana Pérez; Melina Privitelli (J. Complex., 2023)

Interpolation by decomposable univariate polynomials. - Joachim von zur Gathen; Guillermo Matera (J. Complex., 2024)