Anton Leykin
Orcid: 0000-0002-9216-3514
According to our database1,
Anton Leykin
authored at least 43 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
PL<sub>1</sub>P: Point-Line Minimal Problems under Partial Visibility in Three Views.
Int. J. Comput. Vis., August, 2024
Numer. Algorithms, February, 2024
IEEE Trans. Pattern Anal. Mach. Intell., January, 2024
2023
IEEE Trans. Pattern Anal. Mach. Intell., June, 2023
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
2022
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022
2021
Math. Comput., 2021
2020
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020
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
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
Proceedings of the Mathematical Software - ICMS 2018, 2018
2017
Determinantal representations of hyperbolic curves via polynomial homotopy continuation.
Math. Comput., 2017
2016
2014
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014
2013
2012
2011
2010
ACM Commun. Comput. Algebra, 2010
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010
2009
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm.
Int. J. Comput. Sci. Eng., 2009
2008
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008
2007
Proceedings of the Parallel Symbolic Computation, 2007
2006
Theor. Comput. Sci., 2006
Proceedings of the Mathematical Software, 2006
Proceedings of the Mathematical Software, 2006
2005
Proceedings of the 34th International Conference on Parallel Processing Workshops (ICPP 2005 Workshops), 2005
2004
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