Who am I?

In a nutshell, I'm an Argentinian in Paris. Since Dec. 2015 I've been doing my PhD at PolSys (LIP6 - SU/INRIA/CNRS) under the supervision of Jean-Charles Faugère and Elias Tsigaridas.
I work on effective algorithms to solve sparse polynomial systems from the point of view of Gröbner basis and Resultants.




  • (On going) Philosophiæ doctor, Sorbonne Université, Paris, France. 2015 - 2018 (expected).
    Supervisors: Jean-Charles Faugère and Elias Tsigaridas. (PolSys - LIP6 - SU/INRIA/CNRS)
    Subject: Effective algorithms to solve sparse polynomial systems from the point of view of Gröbner basis and Resultants.
  • Licenciatura en Ciencias de la Computación, Universidad de Buenos Aires, Buenos Aires, Argentina. 2010 - 2015
    (Equivalent to Master's degree in Computer Science, 6-years studies with a final thesis)
    Average: 9.54/10.

Awards and Grants

  • Distinguished Student Author Award. SIGSAM. 2016.
    For the paper "A Superfast Algorithm to Decompose Binary Forms", published at ISSAC 2016
  • PhD Fellowship. INRIA. 2015.
    Three years funding (CORDI-S)
  • Academic Merit Award. Santander Río Bank. 2015.
  • Research Scholarship. INRIA - Campus France. 2015.
    Research intership at PolSys.
  • Exchange Scholarship to Universidad Autónoma de Madrid (UAM), Spain. Santander Río Bank. 2014.
    Fully paid semestral exchange.
  • Research Fellowship “Beca Estímulo a las Vocaciones Científicas 2013”. Consejo Interuniversitario Nacional (CIN), Argentina. 2013.
    Under the supervision of Esteban Feuerstein.

Teaching and Scientific Popularization


  • Teaching Assistant, Computer Science Department, University of Buenos Aires. March 2012 - February 2014 TA at Algorithms & Data Structures II, two semesters in 2012 and one in 2013. Topics include formal specification using ADTs, Software Design, Data Structures, Sorting Algorithms, Divide and Conquer techniques, Complexity Order calculations. Implementations with C++. TA at Algorithms & Data Structures III, one semester in 2013. Topics include Graph Theory, Complexity Theory (P and NP), Dynamic Programming and Backtracking techniques.
  • Informatics Teacher, Escuela Integral Hebrea Natan Gesang, (primary school). April 2010 - January 2012 Computer teacher for kids from six to eight years. Topics include different OSs, basic ofimatics, web design (DreamWeaver) and elementary programming (Scratch).

Scientific Popularization    (Click to see)


Students’ councilor, Council of the Computer Science Department (CoDep), DC-FCEN-UBA.
February 2013 - January 2014. Elected by the students.

Reach me

Campus Pierre et Marie Curie
Sorbonne Université - LIP6
Boîte courrier 169
Couloir 26-00, Étage 3, Bureau 315
4 place Jussieu
75252 PARIS CEDEX 05
Tel: +33 1 44 27 71 02,