| Year |
Citation |
Score |
| 2020 |
Hauenstein JD, Leykin A, Rodriguez JI, Sottile F. A numerical toolkit for multiprojective varieties Ieee Communications Magazine. 1. DOI: 10.1090/Mcom/3566 |
0.325 |
|
| 2019 |
Duff T, Hill C, Jensen AN, Lee K, Leykin A, Sommars J. Solving polynomial systems via homotopy continuation and monodromy Ima Journal of Numerical Analysis. 39: 1421-1446. DOI: 10.1093/Imanum/Dry017 |
0.342 |
|
| 2019 |
Draisma J, Lason M, Leykin A. Stillman’s conjecture via generic initial ideals Communications in Algebra. 47: 2384-2395. DOI: 10.1080/00927872.2019.1574806 |
0.445 |
|
| 2019 |
Leykin A, Yu J. Beyond polyhedral homotopies Journal of Symbolic Computation. 91: 173-180. DOI: 10.1016/J.Jsc.2018.06.019 |
0.467 |
|
| 2017 |
Leykin A, Plaumann D. Determinantal representations of hyperbolic curves via polynomial homotopy continuation Ieee Communications Magazine. 86: 2877-2888. DOI: 10.1090/Mcom/3194 |
0.39 |
|
| 2017 |
Krone R, Leykin A. Numerical algorithms for detecting embedded components Journal of Symbolic Computation. 82: 1-18. DOI: 10.1016/J.Jsc.2016.12.004 |
0.411 |
|
| 2017 |
Krone R, Leykin A. Eliminating dual spaces Journal of Symbolic Computation. 79: 609-622. DOI: 10.1016/J.Jsc.2016.07.022 |
0.384 |
|
| 2017 |
Krone R, Leykin A, Snowden A. Hilbert series of symmetric ideals in infinite polynomial rings via formal languages Journal of Algebra. 485: 353-362. DOI: 10.1016/J.Jalgebra.2017.05.014 |
0.367 |
|
| 2016 |
Leykin A. Polynomial homotopy continuation in Macaulay2 Acm Communications in Computer Algebra. 50: 113-116. DOI: 10.1145/3015306.3015316 |
0.326 |
|
| 2016 |
Jensen A, Leykin A, Yu J. Computing Tropical Curves via Homotopy Continuation Experimental Mathematics. 25: 83-93. DOI: 10.1080/10586458.2015.1037407 |
0.396 |
|
| 2015 |
Draisma J, Eggermont R, Krone R, Leykin A. Noetherianity for infinite-dimensional toric varieties Algebra and Number Theory. 9: 1857-1880. DOI: 10.2140/Ant.2015.9.1857 |
0.413 |
|
| 2013 |
Beltrán C, Leykin A. Robust Certified Numerical Homotopy Tracking Foundations of Computational Mathematics. 13: 253-295. DOI: 10.1007/S10208-013-9143-2 |
0.443 |
|
| 2012 |
Beltrán C, Leykin A. Certified numerical homotopy tracking Experimental Mathematics. 21: 69-83. DOI: 10.1080/10586458.2011.606184 |
0.414 |
|
| 2010 |
Leykin A. Abstract only: Certified numerical solving of systems of polynomial equations Acm Communications in Computer Algebra. 44: 24-24. DOI: 10.1145/1838599.1838610 |
0.407 |
|
| 2010 |
Berkesch C, Leykin A. Algorithms for Bernstein-Sato polynomials and multiplier ideals Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 99-106. |
0.336 |
|
| 2009 |
Leykin A, Verschelde J. Decomposing solution sets of polynomial systems: A new parallel monodromy breakup algorithm International Journal of Computational Science and Engineering. 4: 94-101. DOI: 10.1504/IJCSE.2009.027001 |
0.319 |
|
| 2009 |
Leykin A, Sottile F. Galois groups of Schubert problems via homotopy computation Mathematics of Computation. 78: 1749-1765. DOI: 10.1090/S0025-5718-09-02239-X |
0.384 |
|
| 2009 |
Aschenbrenner M, Leykin A. Degree bounds for Gröbner bases in algebras of solvable type Journal of Pure and Applied Algebra. 213: 1578-1605. DOI: 10.1016/J.Jpaa.2008.11.022 |
0.423 |
|
| 2007 |
Leykin A, Sottile F. Computing monodromy via parallel homotopy continuation Pasco'07: Proceedings of the 2007 International Workshop On Parallel Symbolic Computation. 97-98. DOI: 10.1145/1278177.1278195 |
0.399 |
|
| 2006 |
Leykin A, Verschelde J, Zhao A. Newton's method with deflation for isolated singularities of polynomial systems Theoretical Computer Science. 359: 111-122. DOI: 10.1016/J.Tcs.2006.02.018 |
0.381 |
|
| 2006 |
Àlvarez Montaner J, Leykin A. Computing the support of local cohomology modules Journal of Symbolic Computation. 41: 1328-1344. DOI: 10.1016/J.Jsc.2006.09.001 |
0.397 |
|
| 2006 |
Leykin A, Verschelde J, Zhuang Y. Parallel homotopy algorithms to solve polynomial systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4151: 225-234. |
0.309 |
|
| 2004 |
Leykin A. On parallel computation of Gröbner bases Proceedings of the International Conference On Parallel Processing Workshops. 160-164. DOI: 10.1109/ICPPW.2004.1328011 |
0.355 |
|
| 2004 |
Leykin A. Algorithmic proofs of two theorems of Stafford Journal of Symbolic Computation. 38: 1535-1550. DOI: 10.1016/J.Jsc.2004.07.003 |
0.415 |
|
| 2001 |
Leykin A. Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: An algorithmic approach Journal of Symbolic Computation. 32: 663-675. DOI: 10.1006/Jsco.2001.0488 |
0.31 |
|
| Show low-probability matches. |