[2] He performed his habilitation in 1986 at the J.W.von Goethe University in Frankfurt am Main[3] where he also studied Turcology and Sephardic history and culture.

For this purpose, he developed with his collaborators, different mathematical tools, e.g. the Bezout Inequality[4] or the first effective Nullstellensatz in arbitrary characteristic.

The outcome was a worst case optimal probabilistic elimination algorithm with the ability to recognize “easily solvable” input systems which was later implemented by Grégoire Lecerf.

[7] Finally, Heintz and his collaborators demonstrated that under fragile and natural assumptions, the worst case complexity of elimination algorithms is unavoidably exponential, independent of the chosen data structure.

Noaï Fitchas was used as a pseudonym for the Argentinean group and numerous influential papers in Computer Algebra were published in the nineties under this name.