| Twenty-four hours of local cohomology S Iyengar American Mathematical Soc., 2007 | 273 | 2007 |
| Newton's method with deflation for isolated singularities of polynomial systems A Leykin, J Verschelde, A Zhao Theoretical Computer Science 359 (1-3), 111-122, 2006 | 187 | 2006 |
| Solving polynomial systems via homotopy continuation and monodromy T Duff, C Hill, A Jensen, K Lee, A Leykin, J Sommars IMA Journal of Numerical Analysis 39 (3), 1421-1446, 2019 | 107 | 2019 |
| Numerical algebraic geometry A Leykin Journal of Software for Algebra and Geometry 3 (1), 5-10, 2011 | 98 | 2011 |
| Higher-order deflation for polynomial systems with isolated singular solutions A Leykin, J Verschelde, A Zhao Algorithms in algebraic geometry, 79-97, 2008 | 75 | 2008 |
| Certified numerical homotopy tracking C Beltrán, A Leykin Experimental Mathematics 21 (1), 69-83, 2012 | 68 | 2012 |
| Robust certified numerical homotopy tracking C Beltrán, A Leykin Foundations of Computational Mathematics 13, 253-295, 2013 | 64 | 2013 |
| Galois groups of Schubert problems via homotopy computation A Leykin, F Sottile Mathematics of Computation 78 (267), 1749-1765, 2009 | 52 | 2009 |
| Algorithmic proofs of two theorems of Stafford A Leykin Journal of Symbolic Computation 38 (6), 1535-1550, 2004 | 48 | 2004 |
| PLMP: point-line minimal problems in complete multi-view visibility T Duff, K Kohn, A Leykin, T Pajdla Proceedings of the IEEE/CVF International Conference on Computer Vision …, 2019 | 47 | 2019 |
| Learning to solve hard minimal problems P Hruby, T Duff, A Leykin, T Pajdla Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern …, 2022 | 38 | 2022 |
| Constructibility of the set of polynomials with a fixed Bernstein–Sato polynomial: an algorithmic approach A Leykin Journal of Symbolic Computation 32 (6), 663-675, 2001 | 38 | 2001 |
| Trace test A Leykin, JI Rodriguez, F Sottile Arnold Mathematical Journal 4, 113-125, 2018 | 35 | 2018 |
| Numerical primary decomposition A Leykin Proceedings of the twenty-first international symposium on Symbolic and …, 2008 | 34 | 2008 |
| Noetherianity for infinite-dimensional toric varieties J Draisma, R Eggermont, R Krone, A Leykin Algebra & Number Theory 9 (8), 1857-1880, 2015 | 30 | 2015 |
| Stillman’s conjecture via generic initial ideals J Draisma, M Lasoń, A Leykin Communications in algebra 47 (6), 2384-2395, 2019 | 27 | 2019 |
| Hilbert series of symmetric ideals in infinite polynomial rings via formal languages R Krone, A Leykin, A Snowden Journal of Algebra 485, 353-362, 2017 | 25 | 2017 |
| Algorithms for Bernstein--Sato polynomials and multiplier ideals C Berkesch, A Leykin Proceedings of the 2010 International Symposium on Symbolic and Algebraic …, 2010 | 25 | 2010 |
| Evaluation of Jacobian matrices for Newton’s method with deflation to approximate isolated singular solutions of polynomial systems A Leykin, J Verschelde, A Zhao Symbolic-Numeric Computation, 269-278, 2007 | 25 | 2007 |
| Parallel homotopy algorithms to solve polynomial systems A Leykin, J Verschelde, Y Zhuang International Congress on Mathematical Software, 225-234, 2006 | 25 | 2006 |
Jan VerscheldeProfessor of Mathematics, Statistics, and Computer Science, University of Illinois at ChicagoVerified email at uic.edu
