Luis M. Pardo Home Page Coauthor index DBLP Vis pubzone.org

Luis Miguel Pardo

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo: On the intrinsic complexity of point finding in real singular hypersurfaces. Inf. Process. Lett. 109(19): 1141-1144 (2009)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndré Galligo, Luis Miguel Pardo, Josef Schicho: Effective methods in algebraic geometry. J. Symb. Comput. 44(9): 1087-1088 (2009)
2008
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosé Luis Montaña, Luis Miguel Pardo, Mar Callau: VC Dimension Bounds for Analytic Algebraic Computations. COCOON 2008: 62-71
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarlos Beltrán, Luis Miguel Pardo: On Smale's 17th Problem: A Probabilistic Positive Solution. Foundations of Computational Mathematics 8(1): 1-43 (2008)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCruz E. Borges, Luis M. Pardo: On the probability distribution of data at points in real complete intersection varieties. J. Complexity 24(4): 492-523 (2008)
2007
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarlos Beltrán, Luis Miguel Pardo: Estimates on the Distribution of the Condition Number of Singular Matrices. Foundations of Computational Mathematics 7(1): 87-134 (2007)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarlos Beltrán, Luis Miguel Pardo: On the probability distribution of singular varieties of given corank. J. Symb. Comput. 42(1-2): 4-29 (2007)
2006
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Lickteig, Klaus Meer, Luis Miguel Pardo: Real Computation and Complexity, 1.-6. February 2004 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
2005
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCésar Luis Alonso, José Luis Montaña, Luis Miguel Pardo: On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions. MFCS 2005: 83-94
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo: Generalized polar varieties: geometry and algorithms. J. Complexity 21(4): 377-412 (2005)
2004
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity 2004
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Summary - Real Computation and Complexity. Real Computation and Complexity 2004
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuis Miguel Pardo, Jorge San Martín: Deformation techniques to solve generalised Pham systems. Theor. Comput. Sci. 315(2-3): 593-625 (2004)
2003
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLD. Castro, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo: The Hardness of Polynomial Equation Solving. Foundations of Computational Mathematics 3(4): 347-420 (2003)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLD. Castro, Luis Miguel Pardo, Jorge San Martín: Systems of rational polynomial equations have polynomial size approximate zeros on the average. J. Complexity 19(2): 161-209 (2003)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Giusti, Luis Miguel Pardo: Preface. J. Symb. Comput. 36(3-4): 287 (2003)
2002
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLD. Castro, José Luis Montaña, Luis Miguel Pardo, Jorge San Martín: The Distribution of Condition Numbers of Rational Data of Bounded Bit Length. Foundations of Computational Mathematics 2(1): 1-52 (2002)
2001
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLD. Castro, Luis Miguel Pardo, Klemens Hägele, Jose Enrique Morais: Kronecker's and Newton's Approaches to Solving: A First Comparison. J. Complexity 17(1): 212-303 (2001)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikel Aldaz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo: A new method to obtain lower bounds for polynomial evaluation. Theor. Comput. Sci. 259(1-2): 577-596 (2001)
2000
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo: Time-Space Tradeoffs in Algebraic Complexity Theory. J. Complexity 16(1): 2-49 (2000)
1998
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo: Combinatorial Hardness Proofs for Polynomial Evaluation. MFCS 1998: 167-175
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosé Luis Montaña, Luis Miguel Pardo: On Kolmogorov Complexity in the Real Turing Machine Setting. Inf. Process. Lett. 67(2): 81-86 (1998)
1995
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo: When Polynomial Equation Systems Can Be "Solved" Fast?. AAECC 1995: 205-231
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuis Miguel Pardo: How Lower and Upper Complexity Bounds Meet in Elimination Theory. AAECC 1995: 33-69
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosé Luis Montaña, Jose Enrique Morais, Luis Miguel Pardo: Lower Bounds for Arithmetic Networks II: Sum of Betti Numbers. Appl. Algebra Eng. Commun. Comput. 7(1): 41-51 (1995)
1994
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosé Luis Montaña, Luis Miguel Pardo, Tomás Recio: A Note on Rabin's Width of a Complete Proof. Computational Complexity 4: 12-36 (1994)
1993
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosé Luis Montaña, Luis Miguel Pardo: Lower Bounds for Arithmetic Networks. Appl. Algebra Eng. Commun. Comput. 4: 1-24 (1993)
1987
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFelipe 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. AAECC 1987: 161-181
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Recio, Luis Miguel Pardo: Rabin's width of a complete proof and the width of a semialgebraic set. EUROCAL 1987: 456-462

Coauthor Index

1Mikel Aldaz [9] [10] [11]
2César Luis Alonso [21]
3Bernd Bank [20] [29]
4Carlos Beltrán [23] [24] [26]
5Cruz E. Borges [25]
6Mar Callau [27]
7D. Castro [12] [13] [15] [16]
8Felipe Cucker [2]
9André Galligo [28]
10Marc Giusti [7] [14] [16] [20] [29]
11Klemens Hägele [12]
12Joos Heintz [7] [9] [10] [16] [20] [29]
13Thomas Lickteig [18] [19] [22]
14Jorge San Martín [13] [15] [17]
15Guillermo Matera [9] [10] [11] [16]
16Klaus Meer [18] [19] [22]
17José Luis Montaña (José L. Montaña) [3] [4] [5] [8] [9] [10] [11] [13] [21] [27]
18Jose Enrique Morais [5] [7] [12]
19Mario Raimondo [2]
20Tomás Recio [1] [2] [4]
21Marie-Françoise Roy [2]
22Josef Schicho [28]

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)