Improved explicit estimates on the number of solutions of equations over a finite field A Cafure, G Matera Finite Fields and Their Applications 12 (2), 155-185, 2006 | 72 | 2006 |

The hardness of polynomial equation solving D Castro, M Giusti, J Heintz, G Matera, LM Pardo Foundations of Computational Mathematics 3 (4), 347-420, 2003 | 69 | 2003 |

On the time–space complexity of geometric elimination procedures J Heintz, G Matera, A Waissbein Applicable Algebra in Engineering, Communication and Computing 11 (4), 239-296, 2001 | 56 | 2001 |

Deformation techniques for sparse systems G Jeronimo, G Matera, P Solerno, A Waissbein Foundations of Computational Mathematics 9 (1), 1-50, 2009 | 38 | 2009 |

Singularities of symmetric hypersurfaces and an application to Reed-Solomon codes A Cafure, G Matera, M Privitelli arXiv preprint arXiv:1109.2265, 2011 | 25 | 2011 |

The space complexity of elimination theory: Upper bounds G Matera, JMT Torres Foundations of computational mathematics 1997, 267-276, 1997 | 23 | 1997 |

Fast computation of a rational point of a variety over a finite field A Cafure, G Matera Mathematics of computation 75 (256), 2049-2085, 2006 | 21 | 2006 |

The intrinsic complexity of parametric elimination methods J Heintz, LM Pardo, G Matera Electronic Journal of SADIO 1 (1), 37-51, 1998 | 20 | 1998 |

Probabilistic algorithms for geometric elimination G Matera Applicable Algebra in Engineering, Communication and Computing 9 (6), 463-520, 1999 | 18 | 1999 |

Time-space tradeoffs in algebraic complexity theory M Aldaz, J Heintz, G Matera, JL Montaña, LM Pardo journal of complexity 16 (1), 2-49, 2000 | 16 | 2000 |

An effective Bertini theorem and the number of rational points of a normal complete intersection over a finite field A Cafure, G Matera Acta Arithmetica 130 (1), 19-35, 2007 | 15 | 2007 |

Sobre la complejidad en espacio y tiempo de la eliminación geométrica G Matera Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales, 1997 | 14 | 1997 |

Polynomial equation solving by lifting procedures for ramified fibers A Bompadre, G Matera, R Wachenchauzer, A Waissbein Theoretical computer science 315 (2-3), 335-369, 2004 | 12 | 2004 |

Degeneracy loci and polynomial equation solving B Bank, M Giusti, J Heintz, G Lecerf, G Matera, P Solernó Foundations of Computational Mathematics 15 (1), 159-184, 2015 | 11 | 2015 |

On the value set of small families of polynomials over a finite field, I E Cesaratto, G Matera, M Pérez, M Privitelli arXiv preprint arXiv:1306.1744, 2013 | 11 | 2013 |

Lower complexity bounds for interpolation algorithms N Giménez, J Heintz, G Matera, P Solernó Journal of Complexity 27 (2), 151-187, 2011 | 11 | 2011 |

Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study M De Leo, E Dratman, G Matera Journal of Complexity 21 (4), 502-531, 2005 | 11 | 2005 |

On the value set of small families of polynomials over a finite field, III G Matera, M Pérez, M Privitelli Contemporary Developments in Finite Fields and Applications, World Sci …, 2016 | 10 | 2016 |

Uniform bounds on the number of rational points of a family of curves of genus 2 L Kulesz, G Matera, É Schost Journal of Number Theory 108 (2), 241-267, 2004 | 10 | 2004 |

Combinatorial hardness proofs for polynomial evaluation M Aldaz, J Heintz, G Matera, JL Montaña, LM Pardo International Symposium on Mathematical Foundations of Computer Science, 167-175, 1998 | 10 | 1998 |