On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve. - Felipe Cucker; Luis Miguel Pardo; Mario Raimondo; Tomás Recio; Marie-Françoise Roy (AAECC, 1987)

Rabin's width of a complete proof and the width of a semialgebraic set. - Tomás Recio; Luis Miguel Pardo (EUROCAL, 1987)

Time Bounded Computations over the Reals. - Felipe Cucker; José L. Montaña; Luis M. Pardo (Int. J. Algebra Comput., 1992)

Lower Bounds for Arithmetic Networks. - José Luis Montaña; Luis Miguel Pardo (Appl. Algebra Eng. Commun. Comput., 1993)

A Note on Rabin's Width of a Complete Proof. - José Luis Montaña; Luis Miguel Pardo; Tomás Recio (Comput. Complex., 1994)

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

How Lower and Upper Complexity Bounds Meet in Elimination Theory. - Luis Miguel Pardo (AAECC, 1995)

Lower bounds for arithmetic networks II: Sum of Betti numbers. - José Luis Montaña; Jose Enrique Morais; Luis Miguel Pardo (Appl. Algebra Eng. Commun. Comput., 1995)

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

On Kolmogorov Complexity in the Real Turing Machine Setting. - José Luis Montaña; Luis Miguel Pardo (Inf. Process. Lett., 1998)

Arithmetic Nullstellensätze. - Teresa Krick; Luis Miguel Pardo; Martín Sombra (SIGSAM Bull., 1999)

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

Kronecker's and Newton's Approaches to Solving: A First Comparison. - D. Castro; Luis Miguel Pardo; Klemens Hägele; Jose Enrique Morais (J. Complex., 2001)

A new method to obtain lower bounds for polynomial evaluation. - Mikel Aldaz; Guillermo Matera; José Luis Montaña; Luis Miguel Pardo (Theor. Comput. Sci., 2001)

The Distribution of Condition Numbers of Rational Data of Bounded Bit Length. - D. Castro; José Luis Montaña; Luis Miguel Pardo; Jorge San Martín (Found. Comput. Math., 2002)

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

Systems of rational polynomial equations have polynomial size approximate zeros on the average. - D. Castro; Luis Miguel Pardo; Jorge San Martín (J. Complex., 2003)

Preface. - Marc Giusti; Luis Miguel Pardo (J. Symb. Comput., 2003)

04061 Summary - Real Computation and Complexity. - Thomas Lickteig; Klaus Meer; Luis Miguel Pardo (Real Computation and Complexity, 2004)

04061 Abstracts Collection - Real Computation and Complexity. - Thomas Lickteig; Klaus Meer; Luis Miguel Pardo (Real Computation and Complexity, 2004)

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

Deformation techniques to solve generalised Pham systems. - Luis Miguel Pardo; Jorge San Martín (Theor. Comput. Sci., 2004)

On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions. - César Luis Alonso; José Luis Montaña; Luis Miguel Pardo (MFCS, 2005)

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

Estimates on the Distribution of the Condition Number of Singular Matrices. - Carlos Beltrán 001; Luis Miguel Pardo (Found. Comput. Math., 2007)

On the probability distribution of singular varieties of given corank. - Carlos Beltrán 001; Luis Miguel Pardo (J. Symb. Comput., 2007)

On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case. - Carlos Beltrán 001; Luis Miguel Pardo (Math. Comput., 2007)

VC Dimension Bounds for Analytic Algebraic Computations. - José Luis Montaña; Luis Miguel Pardo; Mar Callau (COCOON, 2008)

On Smale's 17th Problem: A Probabilistic Positive Solution. - Carlos Beltrán 001; Luis Miguel Pardo (Found. Comput. Math., 2008)

On the probability distribution of data at points in real complete intersection varieties. - Cruz E. Borges; Luis M. Pardo (J. Complex., 2008)

On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations. - José L. Montaña; Luis M. Pardo (Ann. Math. Artif. Intell., 2009)

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

Effective methods in algebraic geometry. - André Galligo; Luis Miguel Pardo; Josef Schicho (J. Symb. Comput., 2009)

Effective methods in algebraic geometry 2009: Barcelona. Guest editors' foreword. - Carlos D'Andrea; Marc Giusti; Luis M. Pardo; Ragni Piene (J. Symb. Comput., 2010)

Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems. - Carlos Beltrán 001; Luis Miguel Pardo (Found. Comput. Math., 2011)

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)

Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian. - Jérémy Berthomieu; Luis Miguel Pardo (J. Complex., 2012)

An Arithmetic Poisson Formula for the multi-variate resultant. - Mario Fernández; Luis M. Pardo (J. Complex., 2013)

A Sharp Fitness Function for the Problem of Finding Roots of Polynomial Equations Systems. - Cruz E. Borges; José Luis Montaña; Luis M. Pardo (IJCCI (ECTA), 2014)

On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant. - Luis M. Pardo; Mario Pardo (Appl. Algebra Eng. Commun. Comput., 2016)

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)

Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study. - Cristina Tîrnauca; José L. Montaña; Santiago Ontañón; Avelino J. Gonzalez; Luis M. Pardo (Sensors, 2016)

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

Special Issue: "Algebraic Geometry from an Algorithmic Point of View", ACA 2019, Montréal, Canada, July 16-20, 2019. - Cristina Bertone; Francesca Cioffi; Luis M. Pardo (Appl. Algebra Eng. Commun. Comput., 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)

A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density. - Luis M. Pardo; Daniel Sebastián (J. Complex., 2022)

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

Exploring implications of Trace (Inversion) formula and Artin algebras in extremal combinatorics. - Luis M. Pardo (Appl. Algebra Eng. Commun. Comput., 2024)

Succinct obituary in memoriam of Joos Heintz. - Luis M. Pardo (J. Complex., 2025)

Erzeugunsgrad, VC-Dimension and Neural Networks with rational activation function. - Luis Miguel Pardo; Daniel Sebastián (CoRR, 2025)