Anton Leykin

Orcid: 0000-0002-9216-3514

According to our database1, Anton Leykin authored at least 43 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
u-generation: solving systems of polynomials equation-by-equation.
Numer. Algorithms, February, 2024

PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility.
IEEE Trans. Pattern Anal. Mach. Intell., January, 2024

2023
Trifocal Relative Pose From Lines at Points.
IEEE Trans. Pattern Anal. Mach. Intell., June, 2023

Foreword.
J. Symb. Comput., 2023

Numerical Nonlinear Algebra.
CoRR, 2023

Isolating clusters of zeros of analytic systems using arbitrary-degree inflation.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
Noetherian operators and primary decomposition.
J. Symb. Comput., 2022

Learning to Solve Hard Minimal Problems.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021
Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm.
Math. Comput., 2021

A numerical toolkit for multiprojective varieties.
Math. Comput., 2021

2020
Inflation of poorly conditioned zeros of systems of analytic functions.
CoRR, 2020

PL<sub>1</sub>P - Point-Line Minimal Problems Under Partial Visibility in Three Views.
Proceedings of the Computer Vision - ECCV 2020, 2020

TRPLP - Trifocal Relative Pose From Lines at Points.
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

2019
Beyond polyhedral homotopies.
J. Symb. Comput., 2019

Trifocal Relative Pose from Lines at Points and its Efficient Solution.
CoRR, 2019

Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Monodromy Solver: Sequential and Parallel.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Homotopy Continuation in Macaulay2.
Proceedings of the Mathematical Software - ICMS 2018, 2018

2017
Determinantal representations of hyperbolic curves via polynomial homotopy continuation.
Math. Comput., 2017

Numerical algorithms for detecting embedded components.
J. Symb. Comput., 2017

2016
Computing Tropical Curves via Homotopy Continuation.
Exp. Math., 2016

Solving polynomial systems via homotopy continuation and monodromy.
CoRR, 2016

Polynomial homotopy continuation in Macaulay2.
ACM Commun. Comput. Algebra, 2016

2014
Equivariant lattice generators and Markov bases.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
Robust Certified Numerical Homotopy Tracking.
Found. Comput. Math., 2013

Bertini for Macaulay2.
CoRR, 2013

2012
Certified Numerical Homotopy Tracking.
Exp. Math., 2012

2011
A search for an optimal start system for numerical homotopy continuation
CoRR, 2011

2010
Abstract only: Certified numerical solving of systems of polynomial equations.
ACM Commun. Comput. Algebra, 2010

Algorithms for Bernstein-Sato polynomials and multiplier ideals.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009
Galois groups of Schubert problems via homotopy computation.
Math. Comput., 2009

Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm.
Int. J. Comput. Sci. Eng., 2009

Numerical Algebraic Geometry for Macaulay2
CoRR, 2009

2008
Numerical primary decomposition.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
Computing monodromy via parallel homotopy continuation.
Proceedings of the Parallel Symbolic Computation, 2007

2006
Newton's method with deflation for isolated singularities of polynomial systems.
Theor. Comput. Sci., 2006

Computing the support of local cohomology modules.
J. Symb. Comput., 2006

Parallel Homotopy Algorithms to Solve Polynomial Systems.
Proceedings of the Mathematical Software, 2006

Interfacing with the Numerical Homotopy Algorithms in <i>PHCpack</i>.
Proceedings of the Mathematical Software, 2006

2005
Factoring Solution Sets of Polynomial Systems in Parallel.
Proceedings of the 34th International Conference on Parallel Processing Workshops (ICPP 2005 Workshops), 2005

2004
Algorithmic proofs of two theorems of Stafford.
J. Symb. Comput., 2004

On Parallel Computation of Gröbner Bases.
Proceedings of the 33rd International Conference on Parallel Processing Workshops (ICPP 2004 Workshops), 2004

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


  Loading...