Guillermo Matera

563 total citations
32 papers, 249 citations indexed

About

Guillermo Matera is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Guillermo Matera has authored 32 papers receiving a total of 249 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 13 papers in Artificial Intelligence and 10 papers in Geometry and Topology. Recurrent topics in Guillermo Matera's work include Polynomial and algebraic computation (22 papers), Coding theory and cryptography (10 papers) and Algebraic Geometry and Number Theory (9 papers). Guillermo Matera is often cited by papers focused on Polynomial and algebraic computation (22 papers), Coding theory and cryptography (10 papers) and Algebraic Geometry and Number Theory (9 papers). Guillermo Matera collaborates with scholars based in Argentina, Spain and France. Guillermo Matera's co-authors include Joos Heintz, Luis Miguel Pardo, M Giusti, Pablo Solernó, David J. Castro, Alexandre Sedoglavic, Éric Schost, José Luis Montaña, Pierrick Gaudry and Nicolas Bruno and has published in prestigious journals such as Mathematics of Computation, Journal of Computational and Applied Mathematics and Theoretical Computer Science.

In The Last Decade

Guillermo Matera

30 papers receiving 228 citations

Peers

Guillermo Matera

CTM

AI

GT

ANT

CM

A. L. Chistov Russia

Pablo Solernó Argentina

John P. May United States

Enrico Carlini Italy

Michael Kalkbrener Switzerland

Yaroslav Shitov Russia

Martı́n Sombra Spain

Carlos D’Andrea Spain

John Abbott Italy

Daniel Robertz Germany

A. L. Chistov Russia

Guillermo Matera

177 ×0.9

CTM

68 ×0.7

AI

102 ×1.3

GT

66 ×0.8

ANT

34 ×0.5

CM

Citations per year, relative to Guillermo Matera Guillermo Matera (= 1×) peers A. L. Chistov

Countries citing papers authored by Guillermo Matera

Since Specialization

Citations

This map shows the geographic impact of Guillermo Matera's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Guillermo Matera with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Guillermo Matera more than expected).

Fields of papers citing papers by Guillermo Matera

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Guillermo Matera. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Guillermo Matera. The network helps show where Guillermo Matera may publish in the future.

Co-authorship network of co-authors of Guillermo Matera

This figure shows the co-authorship network connecting the top 25 collaborators of Guillermo Matera. A scholar is included among the top collaborators of Guillermo Matera based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Guillermo Matera. Guillermo Matera is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Gathen, Joachim von zur & Guillermo Matera. (2024). Interpolation by decomposable univariate polynomials. Journal of Complexity. 85. 101885–101885.

2.

Matera, Guillermo, et al.. (2019). Factorization patterns on nonlinear families of univariate polynomials over a finite field. Journal of Algebraic Combinatorics. 51(1). 103–153. 1 indexed citations

3.

Matera, Guillermo, et al.. (2015). Newton’s method and a mesh-independence principle for certain semilinear boundary-value problems. Journal of Computational and Applied Mathematics. 292. 188–212. 1 indexed citations

4.

Heintz, Joos, et al.. (2015). Quiz games as a model for information hiding. Journal of Complexity. 34. 1–29. 1 indexed citations

5.

Matera, Guillermo, et al.. (2014). On the value set of small families of polynomials over a finite field, I. Journal of Combinatorial Theory Series A. 124. 203–227. 4 indexed citations

6.

Matera, Guillermo, et al.. (2014). Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field. Finite Fields and Their Applications. 31. 42–83. 5 indexed citations

7.

Gathen, Joachim von zur, et al.. (2012). The number of reducible space curves over a finite field. Journal of Number Theory. 133(4). 1409–1434. 2 indexed citations

8.

Heintz, Joos, et al.. (2010). Lower complexity bounds for interpolation algorithms. Journal of Complexity. 27(2). 151–187. 4 indexed citations

9.

Matera, Guillermo, et al.. (2008). Deformation Techniques for Sparse Systems. Foundations of Computational Mathematics. 9(1). 1–50. 18 indexed citations

10.

Heintz, Joos, et al.. (2007). Time-Space Tradeoffs for Polynomial Evaluation.

11.

Matera, Guillermo, et al.. (2006). Inverting bijective polynomial maps over finite fields. 315. 27–31. 1 indexed citations

12.

Matera, Guillermo, et al.. (2005). Improved explicit estimates on the number of solutions of equations over a finite field. Finite Fields and Their Applications. 12(2). 155–185. 61 indexed citations

13.

Matera, Guillermo, et al.. (2004). Polynomial equation solving by lifting procedures for ramified fibers. Theoretical Computer Science. 315(2-3). 335–369. 7 indexed citations

14.

Matera, Guillermo, et al.. (2004). Uniform bounds on the number of rational points of a family of curves of genus 2. Journal of Number Theory. 108(2). 241–267. 3 indexed citations

15.

Matera, Guillermo & Alexandre Sedoglavic. (2003). Fast computation of discrete invariants associated to a differential rational mapping. Journal of Symbolic Computation. 36(3-4). 473–499. 4 indexed citations

16.

Bruno, Nicolas, et al.. (2002). Functional programming concepts and straight-line programs in computer algebra. Mathematics and Computers in Simulation. 60(6). 423–473. 2 indexed citations

17.

Matera, Guillermo, et al.. (2001). A new method to obtain lower bounds for polynomial evaluation. Theoretical Computer Science. 259(1-2). 577–596. 2 indexed citations

18.

Heintz, Joos, et al.. (2001). On the Time-Space Complexity of Geometric Elimination Procedures. Applicable Algebra in Engineering Communication and Computing. 11(4). 239–296. 27 indexed citations

19.

Heintz, Joos, et al.. (2000). Time-Space Tradeoffs in Algebraic Complexity Theory. Journal of Complexity. 16(1). 2–49. 4 indexed citations

20.

Matera, Guillermo. (1999). Probabilistic Algorithms for Geometric Elimination. Applicable Algebra in Engineering Communication and Computing. 9(6). 463–520. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact