The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Luis Miguel Pardo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Felipe Cucker, Luis Miguel Pardo, Mario Raimondo, Tomás Recio, Marie-Françoise Roy
    On the Computation of the Local and Global Analytic Branches of a Real Algebraic Curve. [Citation Graph (0, 0)][DBLP]
    AAECC, 1987, pp:161-181 [Conf]
  2. Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo
    When Polynomial Equation Systems Can Be "Solved" Fast?. [Citation Graph (0, 0)][DBLP]
    AAECC, 1995, pp:205-231 [Conf]
  3. Luis Miguel Pardo
    How Lower and Upper Complexity Bounds Meet in Elimination Theory. [Citation Graph (0, 0)][DBLP]
    AAECC, 1995, pp:33-69 [Conf]
  4. Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
    04061 Summary - Real Computation and Complexity. [Citation Graph (0, 0)][DBLP]
    Real Computation and Complexity, 2004, pp:- [Conf]
  5. Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
    04061 Abstracts Collection - Real Computation and Complexity. [Citation Graph (0, 0)][DBLP]
    Real Computation and Complexity, 2004, pp:- [Conf]
  6. Tomás Recio, Luis Miguel Pardo
    Rabin's width of a complete proof and the width of a semialgebraic set. [Citation Graph (0, 0)][DBLP]
    EUROCAL, 1987, pp:456-462 [Conf]
  7. Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
    Combinatorial Hardness Proofs for Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:167-175 [Conf]
  8. César Luis Alonso, José Luis Montaña, Luis Miguel Pardo
    On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:83-94 [Conf]
  9. José Luis Montaña, Jose Enrique Morais, Luis Miguel Pardo
    Lower Bounds for Arithmetic Networks II: Sum of Betti Numbers. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1995, v:7, n:1, pp:41-51 [Journal]
  10. José Luis Montaña, Luis Miguel Pardo
    Lower Bounds for Arithmetic Networks. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1993, v:4, n:, pp:1-24 [Journal]
  11. José Luis Montaña, Luis Miguel Pardo, Tomás Recio
    A Note on Rabin's Width of a Complete Proof. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:12-36 [Journal]
  12. D. Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo
    The Hardness of Polynomial Equation Solving. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2003, v:3, n:4, pp:347-420 [Journal]
  13. D. Castro, José Luis Montaña, Luis Miguel Pardo, Jorge San Martín
    The Distribution of Condition Numbers of Rational Data of Bounded Bit Length. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2002, v:2, n:1, pp:1-52 [Journal]
  14. José Luis Montaña, Luis Miguel Pardo
    On Kolmogorov Complexity in the Real Turing Machine Setting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:2, pp:81-86 [Journal]
  15. Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
    Time-Space Tradeoffs in Algebraic Complexity Theory. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:2-49 [Journal]
  16. Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo
    Generalized polar varieties: geometry and algorithms. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:377-412 [Journal]
  17. D. Castro, Luis Miguel Pardo, Jorge San Martín
    Systems of rational polynomial equations have polynomial size approximate zeros on the average. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2003, v:19, n:2, pp:161-209 [Journal]
  18. D. Castro, Luis Miguel Pardo, Klemens Hägele, Jose Enrique Morais
    Kronecker's and Newton's Approaches to Solving: A First Comparison. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2001, v:17, n:1, pp:212-303 [Journal]
  19. Marc Giusti, Luis Miguel Pardo
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:3-4, pp:287- [Journal]
  20. Carlos Beltrán, Luis Miguel Pardo
    On the probability distribution of singular varieties of given corank. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2007, v:42, n:1-2, pp:4-29 [Journal]
  21. Mikel Aldaz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
    A new method to obtain lower bounds for polynomial evaluation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:577-596 [Journal]
  22. Luis Miguel Pardo, Jorge San Martín
    Deformation techniques to solve generalised Pham systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:315, n:2-3, pp:593-625 [Journal]
  23. Carlos Beltrán, Luis Miguel Pardo
    Estimates on the Distribution of the Condition Number of Singular Matrices. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2007, v:7, n:1, pp:87-134 [Journal]

  24. VC Dimension Bounds for Analytic Algebraic Computations. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002