Who am I?

In a nutshell, I'm an Argentinian in Berlin. I'm a Postdoc in the group Algorithmic Algebra (Institut für Mathematik - Technische Universität Berlin) led by Peter Bürgisser.

Since June 2019, I hold a PhD from Sorbonne Université. My advisors were Jean-Charles Faugère and Elias Tsigaridas. My PhD thesis was about effective algorithms to solve sparse polynomial systems from the point of view of Gröbner bases and Resultants. Take a look!




  • Muphasa (Joint work with Oliver Gäfvert, and Michael Lesnick)
    Open-source C++ software (~6k lines) to compute presentations of multi-parameter persistent homologies.
  • EigenvalueSolver.jl (Joint work with Simon Telen)
    Open-source Julia package (~1k lines) to compute solve numerically polynomial systems.
    More information.
  • sylvesterMEP (Joint work with Jean-Charles Faugère, Angelos Mantzaflaris, and Elias Tsigaridas)
    Open-source Matlab script to solve the multi-parameter eigenvalue problem.
    More information.
  • Classifier-construction (Joint work with Robert Schwieger, Heike Siebert, and Christian Haase)
    Open-source python code to compute classifiers on Boolean networks using Groebner basis.
    More information.


(See all)


  • PhD Student, Sorbonne Université, Paris, France. 2016 - 2019.
    Advisors: Jean-Charles Faugère and Elias Tsigaridas (PolSys - LIP6 - SU/INRIA/CNRS)
    Title: Algorithms for sparse polynomial systems: 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, Grants, and Recognitions

(See all)

Teaching and Scientific Popularization


  • Qualified in sections 25, 26, and 27 for maître de conférences (France).
  • 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).
  • In France, I am qualified in section 25, 26, and 27 for MCF.

Scientific Popularization    (Click to see)

Reach me

Technische Universität Berlin
Institut für Mathematik
Sekretariat MA 3-2
Straße des 17. Juni 136
10623 Berlin
Tel: +49 (0)30 314-29280
Office: Raum MA 319 (3. OG) - Institut für Mathematik