| Sharp estimates for the arithmetic Nullstellensatz T Krick, LM Pardo, M Sombra | 207 | 2001 |
| A computational method for diophantine approximation T Krick, LM Pardo Algorithms in algebraic geometry and applications, 193-253, 1996 | 148 | 1996 |
| An algorithm for the computation of the radical of an ideal in the ring of polynomials T Krick, A Logar International Symposium on Applied Algebra, Algebraic Algorithms, and Error …, 1991 | 116 | 1991 |
| Deformation techniques for efficient polynomial equation solving J Heintz, T Krick, S Puddu, J Sabia, A Waissbein journal of complexity 16 (1), 70-109, 2000 | 87 | 2000 |
| Heights of varieties in multiprojective spaces and arithmetic Nullstellensätze C d’Andrea, T Krick, M Sombra Annales scientifiques de l'École Normale Supérieure 46 (4), 549-627, 2013 | 79 | 2013 |
| The computational complexity of the Chow form G Jeronimo, T Krick, J Sabia, M Sombra Foundations of Computational Mathematics 4 (1), 41-117, 2004 | 67 | 2004 |
| Amino acid metabolism conflicts with protein diversity T Krick, N Verstraete, LG Alonso, DA Shub, DU Ferreiro, M Shub, ... Molecular biology and evolution 31 (11), 2905-2912, 2014 | 59 | 2014 |
| A numerical algorithm for zero counting, I: Complexity and accuracy F Cucker, T Krick, G Malajovich, M Wschebor Journal of Complexity 24 (5-6), 582-605, 2008 | 49 | 2008 |
| Une approche informatique pour l'approximation diophantienne T Krick, LM Pardo Comptes rendus de l'Académie des sciences. Série 1, Mathématique 318 (5 …, 1994 | 49 | 1994 |
| Computing the homology of real projective sets F Cucker, T Krick, M Shub Foundations of Computational Mathematics 18 (4), 929-970, 2018 | 33 | 2018 |
| A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis F Cucker, T Krick, G Malajovich, M Wschebor Journal of Fixed Point Theory and Applications 6 (2), 285-294, 2009 | 32 | 2009 |
| Membership problem, representation problem and the computation of the radical for one-dimensional ideals T Krick, A Logar Effective Methods in Algebraic Geometry, 203-216, 1991 | 32 | 1991 |
| Algorithmic aspects of Suslin's proof of Serre's conjecture L Caniglia, G Cortiñas, S Danón, J Heintz, T Krick, P Solernó computational complexity 3 (1), 31-55, 1993 | 31 | 1993 |
| Newton–Hensel interpolation lifting M Avendaño, T Krick, A Pacetti Foundations of Computational Mathematics 6 (1), 82-120, 2006 | 29 | 2006 |
| ISSAC D Wang, B Mourrain, SA Abramov, F Boulier, C D'Andrea, F Chen, ... | 27 | 2004 |
| A numerical algorithm for zero counting. III: Randomization and condition F Cucker, T Krick, G Malajovich, M Wschebor Advances in Applied Mathematics 48 (1), 215-248, 2012 | 26 | 2012 |
| Factoring bivariate sparse (lacunary) polynomials M Avendano, T Krick, M Sombra Journal of Complexity 23 (2), 193-216, 2007 | 25 | 2007 |
| Multivariate subresultants in roots C D'Andrea, T Krick, A Szanto Journal of Algebra 302 (1), 16-36, 2006 | 25 | 2006 |
| An elementary proof of Sylvester’s double sums for subresultants C D’Andrea, H Hong, T Krick, A Szanto Journal of Symbolic Computation 42 (3), 290-297, 2007 | 23 | 2007 |
| Straight-line programs in polynomial equation solving T Krick Foundations of computational mathematics: Minneapolis 312, 96-136, 2002 | 20 | 2002 |
Carlos D'AndreaProfessor Catedràtic, Universitat de BarcelonaVerified email at ub.edu
