An efficient quantifier elimination algorithm for algebraically closed fields of any characteristic. - Joos Heintz; H. R. Wüthrich (SIGSAM Bull., 1975)

Untere Schranken für die Komplexität logischer Entscheidungsprobleme. - Joos Heintz (Komplexität von Entscheidungsproblemen 1976, 1976)

A New Method to Show Lower Bounds for Polynomials which are Hard to Compute. - Joos Heintz (Theoretical Computer Science, 1979)

Testing Polynomials which Are Easy to Compute (Extended Abstract) - Joos Heintz; Claus-Peter Schnorr (STOC, 1980)

Lower Bounds for Polynomials with Algebraic Coefficients. - Joos Heintz; Malte Sieveking (Theor. Comput. Sci., 1980)

Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. - Joos Heintz; Malte Sieveking (ICALP, 1981)

Definability and Fast Quantifier Elimination in Algebraically Closed Fields. - Joos Heintz (Theor. Comput. Sci., 1983)

On associative algebras of minimal rank. - Joos Heintz; Jacques Morgenstern (AAECC, 1984)

A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras. - Hans F. de Groote; Joos Heintz (AAECC, 1985)

Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. - Joos Heintz (Theor. Comput. Sci., 1985)

On Polynomials with Symmetric Galois Group which Are Easy to Compute. - Joos Heintz (Theor. Comput. Sci., 1986)

On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey. - Joos Heintz (AAECC, 1987)

On the Complexity of Lie Algebras. - Hans F. de Groote; Joos Heintz; Stefan Möhler; Heinz Schmidt (FCT, 1987)

Some New Effectivity Bounds in Computational Geometry. - Leandro Caniglia; André Galligo; Joos Heintz (AAECC, 1988)

Real Quantifier Elimination is Doubly Exponential. - James H. Davenport; Joos Heintz (J. Symb. Comput., 1988)

On the Complexity of Semialgebraic Sets. - Joos Heintz; Pablo Solernó; Marie-Françoise Roy (IFIP Congress, 1989)

Geometric Problems Solvable in Single Exponential Time. - Joos Heintz; Teresa Krick; Marie-Françoise Roy; Pablo Solernó (AAECC, 1990)

Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface. - Joos Heintz; Marie-Françoise Roy; Pablo Solernó (AAECC, 1990)

Algorithms in Real Algebraic Geometry and Applications to Computational Geometry. - Joos Heintz; Tomás Recio; Marie-Françoise Roy (Discrete and Computational Geometry, 1990)

Equations for the projective closure and effective Nullstellensatz. - Leandro Caniglia; André Galligo; Joos Heintz (Discret. Appl. Math., 1991)

(Working Group Noaï Fitchas) Algorithmic Aspects of Suslin's Proof of Serre's Conjecture. - Leandro Caniglia; Guillermo Cortiñas; Silvia Danón; Joos Heintz; Teresa Krick; Pablo Solernó (Comput. Complex., 1993)

On the Efficiency of Effective Nullstellensätze. - Marc Giusti; Joos Heintz; Juan Sabia (Comput. Complex., 1993)

On the Theoretical and Practical Complexity of the Existential Theory of Reals. - Joos Heintz; Marie-Françoise Roy; Pablo Solernó (Comput. J., 1993)

On the Intrinsic Complexity of Elimination Theory. - Joos Heintz; Jacques Morgenstern (J. Complex., 1993)

Description of the Connected Components of a Semialgebraic in Single Exponential Time. - Joos Heintz; Marie-Françoise Roy; Pablo Solernó (Discret. Comput. Geom., 1994)

When Polynomial Equation Systems Can Be "Solved" Fast?. - Marc Giusti; Joos Heintz; Jose Enrique Morais; Luis Miguel Pardo (AAECC, 1995)

Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case. - Bernd Bank; Marc Giusti; Joos Heintz; Guy M. Mbakop (J. Complex., 1997)

Combinatorial Hardness Proofs for Polynomial Evaluation. - Mikel Aldaz; Joos Heintz; Guillermo Matera; José Luis Montaña; Luis Miguel Pardo (MFCS, 1998)

OpTERA - Optimization and Real Equation Solving. - Bernd Bank; Joos Heintz; Lutz Lehmann; Guillermo Matera; Guy M. Mbakop; Rosita Wachenchauzer; Ariel Waissbein (German-Argentinian Workshop on Information Technology, 1999)

Time-Space Tradeoffs in Algebraic Complexity Theory. - Mikel Aldaz; Joos Heintz; Guillermo Matera; José Luis Montaña; Luis Miguel Pardo (J. Complex., 2000)

Deformation Techniques for Efficient Polynomial Equation Solving. - Joos Heintz; Teresa Krick; Susana Puddu; Juan Sabia; Ariel Waissbein (J. Complex., 2000)

On the Time-Space Complexity of Geometric Elimination Procedures. - Joos Heintz; Guillermo Matera; Ariel Waissbein (Appl. Algebra Eng. Commun. Comput., 2001)

Functional programming concepts and straight-line programs in computer algebra. - N. Bruno; Joos Heintz; Guillermo Matera; Rosita Wachenchauzer (Math. Comput. Simul., 2002)

The Hardness of Polynomial Equation Solving. - David Castro 007; Marc Giusti; Joos Heintz; Guillermo Matera; Luis Miguel Pardo (Found. Comput. Math., 2003)

Constraint Databases, Data Structures and Efficient Query Evaluation. - Joos Heintz; Bart Kuijpers (CDB, 2004)

Generalized polar varieties and an efficient real elimination. - Bernd Bank; Marc Giusti; Joos Heintz; Luis M. Pardo (Kybernetika, 2004)

Generalized polar varieties: geometry and algorithms. - Bernd Bank; Marc Giusti; Joos Heintz; Luis Miguel Pardo (J. Complex., 2005)

07212 Manifesto – Constraint Databases, Geometric Elimination ang Geographic Information Systems. - Bernd Bank; Max J. Egenhofer; Joos Heintz; Bart Kuijpers; Peter Z. Revesz (Constraint Databases, Geometric Elimination and Geographic Information Systems, 2007)

On the intrinsic complexity of point finding in real singular hypersurfaces. - Bernd Bank; Marc Giusti; Joos Heintz; Luis Miguel Pardo (Inf. Process. Lett., 2009)

On the geometry of polar varieties. - Bernd Bank; Marc Giusti; Joos Heintz; Mohab Safey El Din; Éric Schost (Appl. Algebra Eng. Commun. Comput., 2010)

The evaluation of geometric queries: constraint databases and quantifier elimination - Marc Giusti; Joos Heintz; Bart Kuijpers (CoRR, 2011)

Efficient evaluation of specific queries in constraint databases. - Rafael Grimson; Joos Heintz; Bart Kuijpers (Inf. Process. Lett., 2011)

Lower complexity bounds for interpolation algorithms. - Nardo Giménez; Joos Heintz; Guillermo Matera; Pablo Solernó (J. Complex., 2011)

Evaluating geometric queries using few arithmetic operations. - Rafael Grimson; Joos Heintz; Bart Kuijpers (Appl. Algebra Eng. Commun. Comput., 2012)

On the intrinsic complexity of elimination problems in effective Algebraic Geometry - Joos Heintz; Bart Kuijpers; Andres Rojas Paredes (CoRR, 2012)

Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces. - Bernd Bank; Marc Giusti; Joos Heintz; Lutz Lehmann; Luis Miguel Pardo (Found. Comput. Math., 2012)

Software Engineering and complexity in effective Algebraic Geometry. - Joos Heintz; Bart Kuijpers; Andres Rojas Paredes (J. Complex., 2013)

Intrinsic complexity estimates in polynomial optimization. - Bernd Bank; Marc Giusti; Joos Heintz; Mohab Safey El Din (J. Complex., 2014)

Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity. - Bernd Bank; Marc Giusti; Joos Heintz (Math. Comput., 2014)

Degeneracy Loci and Polynomial Equation Solving. - Bernd Bank; Marc Giusti; Joos Heintz; Grégoire Lecerf; Guillermo Matera; Pablo Solernó (Found. Comput. Math., 2015)

Quiz games as a model for information hiding. - Bernd Bank; Joos Heintz; Guillermo Matera; José Luis Montaña; Luis M. Pardo; Andres Rojas Paredes (J. Complex., 2016)

Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases. - Amir Hashemi; Joos Heintz; Luis M. Pardo; Pablo Solernó (CASC, 2020)

On Bézout inequalities for non-homogeneous polynomial ideals. - Amir Hashemi; Joos Heintz; Luis M. Pardo; Pablo Solernó (J. Symb. Comput., 2021)

An unfeasability view of neural network learning. - Joos Heintz; Hvara Ocar; Luis Miguel Pardo; Andres Rojas Paredes; Enrique Carlos Segura (CoRR, 2022)

An unfeasibility view of neural network learning. - Joos Heintz; Luis Miguel Pardo; Enrique Carlos Segura; Hvara Ocar; Andres Rojas Paredes (J. Complex., 2023)