Anton Leykin

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 34

Top Topics

Top Venues

J. Symb. Comput.

Publications

Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla
PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility. IEEE Trans. Pattern Anal. Mach. Intell. 46 (1) (2024)
Timothy Duff, Anton Leykin, Jose Israel Rodriguez
u-generation: solving systems of polynomials equation-by-equation. Numer. Algorithms 95 (2) (2024)
Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla
P: Point-Line Minimal Problems under Partial Visibility in Three Views. Int. J. Comput. Vis. 132 (8) (2024)
Michael A. Burr, Kisun Lee, Anton Leykin
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. CoRR (2023)
Daniel J. Bates, Paul Breiding, Tianran Chen, Jonathan D. Hauenstein, Anton Leykin, Frank Sottile
Numerical Nonlinear Algebra. CoRR (2023)
Michael A. Burr, Kisun Lee, Anton Leykin
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. ISSAC (2023)
Anton Leykin, Pierre Lairez
Foreword. J. Symb. Comput. 115 (2023)
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
Trifocal Relative Pose From Lines at Points. IEEE Trans. Pattern Anal. Mach. Intell. 45 (6) (2023)
Timothy Duff, Anton Leykin, Jose Israel Rodriguez
u-generation: solving systems of polynomials equation-by-equation. CoRR (2022)
Justin Chen, Marc Härkönen, Robert Krone, Anton Leykin
Noetherian operators and primary decomposition. J. Symb. Comput. 110 (2022)
Petr Hruby, Timothy Duff, Anton Leykin, Tomás Pajdla
Learning to Solve Hard Minimal Problems. CVPR (2022)
Anton Leykin, Abraham Martín del Campo, Frank Sottile, Ravi Vakil, Jan Verschelde
Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm. Math. Comput. 90 (329) (2021)
Petr Hruby, Timothy Duff, Anton Leykin, Tomás Pajdla
Learning to Solve Hard Minimal Problems. CoRR (2021)
Jonathan D. Hauenstein, Anton Leykin, Jose Israel Rodriguez, Frank Sottile
A numerical toolkit for multiprojective varieties. Math. Comput. 90 (327) (2021)
Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla
P - Point-line Minimal Problems under Partial Visibility in Three Views. CoRR (2020)
Michael A. Burr, Anton Leykin
Inflation of poorly conditioned zeros of systems of analytic functions. CoRR (2020)
Justin Chen, Marc Härkönen, Robert Krone, Anton Leykin
Noetherian operators and primary decomposition. CoRR (2020)
Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla
P - Point-Line Minimal Problems Under Partial Visibility in Three Views. ECCV (26) (2020)
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
TRPLP - Trifocal Relative Pose From Lines at Points. CVPR (2020)
Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla
PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility. CoRR (2019)
Michael A. Burr, Kisun Lee, Anton Leykin
Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions. ISSAC (2019)
Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla
PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility. ICCV (2019)
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
Trifocal Relative Pose from Lines at Points and its Efficient Solution. CoRR (2019)
Michael A. Burr, Kisun Lee, Anton Leykin
Effective certification of approximate solutions to systems of equations involving analytic functions. CoRR (2019)
Anton Leykin, Josephine Yu
Beyond polyhedral homotopies. J. Symb. Comput. 91 (2019)
Anton Leykin
Homotopy Continuation in Macaulay2. ICMS (2018)
Nathan Bliss, Timothy Duff, Anton Leykin, Jeff Sommars
Monodromy Solver: Sequential and Parallel. CoRR (2018)
Nathan Bliss, Timothy Duff, Anton Leykin, Jeff Sommars
Monodromy Solver: Sequential and Parallel. ISSAC (2018)
Anton Leykin, Daniel Plaumann
Determinantal representations of hyperbolic curves via polynomial homotopy continuation. Math. Comput. 86 (308) (2017)
Robert Krone, Anton Leykin
Numerical algorithms for detecting embedded components. J. Symb. Comput. 82 (2017)
Anton Leykin, Josephine Yu
Beyond Polyhedral Homotopies. CoRR (2017)
Timothy Duff, Cvetelina Hill, Anders Nedergaard Jensen, Kisun Lee, Anton Leykin, Jeff Sommars
Solving polynomial systems via homotopy continuation and monodromy. CoRR (2016)
Anton Leykin
Polynomial homotopy continuation in Macaulay2. ACM Commun. Comput. Algebra 50 (3) (2016)
Anders Nedergaard Jensen, Anton Leykin, Josephine Yu
Computing Tropical Curves via Homotopy Continuation. Exp. Math. 25 (1) (2016)
Thomas Kahle, Robert Krone, Anton Leykin
Equivariant lattice generators and Markov bases. ISSAC (2014)
Daniel J. Bates, Elizabeth Gross, Anton Leykin, Jose Israel Rodriguez
Bertini for Macaulay2. CoRR (2013)
Carlos Beltrán, Anton Leykin
Robust Certified Numerical Homotopy Tracking. Found. Comput. Math. 13 (2) (2013)
Carlos Beltrán, Anton Leykin
Certified Numerical Homotopy Tracking. Exp. Math. 21 (1) (2012)
Anton Leykin
A search for an optimal start system for numerical homotopy continuation CoRR (2011)
Christine Berkesch, Anton Leykin
Algorithms for Bernstein-Sato polynomials and multiplier ideals. ISSAC (2010)
Anton Leykin
Abstract only: Certified numerical solving of systems of polynomial equations. ACM Commun. Comput. Algebra 44 (1/2) (2010)
Anton Leykin, Jan Verschelde
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm. Int. J. Comput. Sci. Eng. 4 (2) (2009)
Anton Leykin
Numerical Algebraic Geometry for Macaulay2 CoRR (2009)
Anton Leykin, Frank Sottile
Galois groups of Schubert problems via homotopy computation. Math. Comput. 78 (267) (2009)
Anton Leykin
Numerical primary decomposition. ISSAC (2008)
Anton Leykin, Frank Sottile
Computing monodromy via parallel homotopy continuation. PASCO (2007)
Anton Leykin, Jan Verschelde, Yan Zhuang
Parallel Homotopy Algorithms to Solve Polynomial Systems. ICMS (2006)
Josep Àlvarez Montaner, Anton Leykin
Computing the support of local cohomology modules. J. Symb. Comput. 41 (12) (2006)
Anton Leykin, Jan Verschelde
. ICMS (2006)
Anton Leykin, Jan Verschelde, Ailing Zhao
Newton's method with deflation for isolated singularities of polynomial systems. Theor. Comput. Sci. 359 (1-3) (2006)
Anton Leykin, Jan Verschelde
Factoring Solution Sets of Polynomial Systems in Parallel. ICPP Workshops (2005)
Anton Leykin, Jan Verschelde
Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm CoRR (2005)
Anton Leykin
On Parallel Computation of Gröbner Bases. ICPP Workshops (2004)
Anton Leykin
Algorithmic proofs of two theorems of Stafford. J. Symb. Comput. 38 (6) (2004)
Anton Leykin
Constructibility of the Set of Polynomials with a Fixed Bernstein-Sato Polynomial: an Algorithmic Approach. J. Symb. Comput. 32 (6) (2001)