Guillermo Matera - Citegraph

Author Info

Name	Affiliation	Papers
GUILLERMO MATERA	Universidad Nacional de General Sarmiento, Instituto del Desarrollo Humano, Juan M. Gutiérrez 1150, B1613GSX, Los Polvorines, Buenos Aires, Argentina	23
Collaborators	Citations	PageRank
28	142	14.06
Referers	Referees	References
140	217	287

Search Limit

100217

Publications (23 rows)

Collaborators (28 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field.	0	0.34	2022
Shifted varieties and discrete neighborhoods around varieties	0	0.34	2018
The distribution of factorization patterns on linear families of polynomials over a finite field	1	0.40	2017
Quiz games as a model for information hiding.	1	0.35	2016
Newton's method and a mesh-independence principle for certain semilinear boundary-value problems	0	0.34	2016
Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field.	1	0.39	2015
On the value set of small families of polynomials over a finite field, I	2	0.48	2014
Degeneracy Loci and Polynomial Equation Solving.	7	0.45	2013
Singularities of symmetric hypersurfaces and Reed-Solomon codes.	5	0.57	2012
Lower complexity bounds for interpolation algorithms	5	0.57	2011
Robust Algorithms For Generalized Pham Systems	3	0.48	2009
Deformation Techniques for Sparse Systems	11	0.55	2009
On the solution of the polynomial systems arising in the discretization of certain ODEs	5	0.54	2009
Fast computation of a rational point of a variety over a finite field	8	0.73	2006
Inverting bijective polynomial maps over finite fields	1	0.36	2006
Improved explicit estimates on the number of solutions of equations over a finite field	19	1.82	2006
The Hardness of Polynomial Equation Solving	30	1.54	2003
The differential Hilbert function of a differential rational mapping can be computed in polynomial time	3	0.45	2002
On the Time–Space Complexity of Geometric Elimination Procedures	25	1.29	2001
Probabilistic Algorithms for Geometric Elimination	7	0.59	1999
OpTERA - Optimization and Real Equation Solving	0	0.34	1999
Combinatorial Hardness Proofs for Polynomial Evaluation	5	0.55	1998
Integration of Multivariate Rational Functions Given by Straight-Line Programs	3	0.61	1995