Constructibility of the Set of Polynomials with a Fixed Bernstein-Sato Polynomial: an Algorithmic Approach. - Anton Leykin (J. Symb. Comput., 2001)

On Parallel Computation of Gröbner Bases. - Anton Leykin (ICPP Workshops, 2004)

Algorithmic proofs of two theorems of Stafford. - Anton Leykin (J. Symb. Comput., 2004)

Factoring Solution Sets of Polynomial Systems in Parallel. - Anton Leykin; Jan Verschelde (ICPP Workshops, 2005)

Interfacing with the Numerical Homotopy Algorithms in PHCpack. - Anton Leykin; Jan Verschelde (ICMS, 2006)

Parallel Homotopy Algorithms to Solve Polynomial Systems. - Anton Leykin; Jan Verschelde; Yan Zhuang (ICMS, 2006)

Computing the support of local cohomology modules. - Josep Àlvarez Montaner; Anton Leykin (J. Symb. Comput., 2006)

Newton's method with deflation for isolated singularities of polynomial systems. - Anton Leykin; Jan Verschelde; Ailing Zhao (Theor. Comput. Sci., 2006)

Computing monodromy via parallel homotopy continuation. - Anton Leykin; Frank Sottile (PASCO, 2007)

Numerical primary decomposition. - Anton Leykin (ISSAC, 2008)

Numerical Algebraic Geometry for Macaulay2 - Anton Leykin (CoRR, 2009)

Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm. - Anton Leykin; Jan Verschelde (Int. J. Comput. Sci. Eng., 2009)

Galois groups of Schubert problems via homotopy computation. - Anton Leykin; Frank Sottile (Math. Comput., 2009)

Algorithms for Bernstein-Sato polynomials and multiplier ideals. - Christine Berkesch; Anton Leykin (ISSAC, 2010)

Abstract only: Certified numerical solving of systems of polynomial equations. - Anton Leykin (ACM Commun. Comput. Algebra, 2010)

A search for an optimal start system for numerical homotopy continuation - Anton Leykin (CoRR, 2011)

Certified Numerical Homotopy Tracking. - Carlos Beltrán 001; Anton Leykin (Exp. Math., 2012)

Bertini for Macaulay2. - Daniel J. Bates; Elizabeth Gross; Anton Leykin; Jose Israel Rodriguez (CoRR, 2013)

Robust Certified Numerical Homotopy Tracking. - Carlos Beltrán 001; Anton Leykin (Found. Comput. Math., 2013)

Equivariant lattice generators and Markov bases. - Thomas Kahle; Robert Krone; Anton Leykin (ISSAC, 2014)

Polynomial homotopy continuation in Macaulay2. - Anton Leykin (ACM Commun. Comput. Algebra, 2016)

Solving polynomial systems via homotopy continuation and monodromy. - Timothy Duff; Cvetelina Hill; Anders Nedergaard Jensen; Kisun Lee; Anton Leykin; Jeff Sommars (CoRR, 2016)

Computing Tropical Curves via Homotopy Continuation. - Anders Nedergaard Jensen; Anton Leykin; Josephine Yu (Exp. Math., 2016)

Numerical algorithms for detecting embedded components. - Robert Krone; Anton Leykin (J. Symb. Comput., 2017)

Determinantal representations of hyperbolic curves via polynomial homotopy continuation. - Anton Leykin; Daniel Plaumann (Math. Comput., 2017)

Homotopy Continuation in Macaulay2. - Anton Leykin (ICMS, 2018)

Monodromy Solver: Sequential and Parallel. - Nathan Bliss; Timothy Duff; Anton Leykin; Jeff Sommars (ISSAC, 2018)

Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions. - Michael A. Burr; Kisun Lee; Anton Leykin (ISSAC, 2019)

Trifocal Relative Pose from Lines at Points and its Efficient Solution. - Ricardo Fabbri; Timothy Duff; Hongyi Fan; Margaret H. Regan; David da Costa de Pinho; Elias P. Tsigaridas; Charles Wrampler; Jonathan D. Hauenstein; Benjamin B. Kimia; Anton Leykin; Tomás Pajdla (CoRR, 2019)

Beyond polyhedral homotopies. - Anton Leykin; Josephine Yu (J. Symb. Comput., 2019)

TRPLP - Trifocal Relative Pose From Lines at Points. - Ricardo Fabbri; Timothy Duff; Hongyi Fan; Margaret H. Regan; David da Costa de Pinho; Elias P. Tsigaridas; Charles W. Wampler; Jonathan D. Hauenstein; Peter J. Giblin; Benjamin B. Kimia; Anton Leykin; Tomás Pajdla (CVPR, 2020)

Inflation of poorly conditioned zeros of systems of analytic functions. - Michael A. Burr; Anton Leykin (CoRR, 2020)

A numerical toolkit for multiprojective varieties. - Jonathan D. Hauenstein; Anton Leykin; Jose Israel Rodriguez; Frank Sottile (Math. Comput., 2021)

Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm. - Anton Leykin; Abraham Martín del Campo; Frank Sottile; Ravi Vakil; Jan Verschelde (Math. Comput., 2021)

Learning to Solve Hard Minimal Problems. - Petr Hruby; Timothy Duff; Anton Leykin; Tomás Pajdla (CVPR, 2022)

Noetherian operators and primary decomposition. - Justin Chen; Marc Härkönen; Robert Krone; Anton Leykin (J. Symb. Comput., 2022)

Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. - Michael A. Burr; Kisun Lee; Anton Leykin (ISSAC, 2023)

Numerical Nonlinear Algebra. - Daniel J. Bates; Paul Breiding; Tianran Chen; Jonathan D. Hauenstein; Anton Leykin; Frank Sottile (CoRR, 2023)

Foreword. - Anton Leykin; Pierre Lairez (J. Symb. Comput., 2023)

Trifocal Relative Pose From Lines at Points. - Ricardo Fabbri; Timothy Duff; Hongyi Fan; Margaret H. Regan; David da Costa de Pinho; Elias P. Tsigaridas; Charles W. Wampler; Jonathan D. Hauenstein; Peter J. Giblin; Benjamin B. Kimia; Anton Leykin; Tomás Pajdla (IEEE Trans. Pattern Anal. Mach. Intell., 2023)

Discrete Shortest Paths in Optimal Power Flow Feasible Regions. - Daniel Turizo; Diego Cifuentes; Anton Leykin; Daniel K. Molzahn (CoRR, 2024)

PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility. - Timothy Duff; Kathlén Kohn; Anton Leykin; Tomás Pajdla (IEEE Trans. Pattern Anal. Mach. Intell., 2024)

u-generation: solving systems of polynomials equation-by-equation. - Timothy Duff; Anton Leykin; Jose Israel Rodriguez (Numer. Algorithms, 2024)

PL1P: Point-Line Minimal Problems under Partial Visibility in Three Views. - Timothy Duff; Kathlén Kohn; Anton Leykin; Tomás Pajdla (Int. J. Comput. Vis., 2024)

Local dual spaces and primary decomposition. - Justin Chen; Marc Härkönen; Anton Leykin (J. Symb. Comput., 2025)