default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton Leykin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j22]Timothy Duff
, Kathlén Kohn, Anton Leykin, Tomás Pajdla:
PL1P: Point-Line Minimal Problems under Partial Visibility in Three Views. Int. J. Comput. Vis. 132(8): 3302-3323 (2024)- [j21]Timothy Duff, Anton Leykin, Jose Israel Rodriguez:
u-generation: solving systems of polynomials equation-by-equation. Numer. Algorithms 95(2): 813-838 (2024) - [j20]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): 421-435 (2024) - 2023
- [j19]Anton Leykin, Pierre Lairez:
Foreword. J. Symb. Comput. 115: 407-408 (2023) - [j18]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): 7870-7884 (2023) - 2022
- [j17]Justin Chen, Marc Härkönen, Robert Krone, Anton Leykin:
Noetherian operators and primary decomposition. J. Symb. Comput. 110: 1-23 (2022) - 2021
- [j16]Jonathan D. Hauenstein, Anton Leykin, Jose Israel Rodriguez, Frank Sottile:
A numerical toolkit for multiprojective varieties. Math. Comput. 90(327): 413-440 (2021) - [j15]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): 1407-1433 (2021) - 2019
- [j14]Anton Leykin, Josephine Yu:
Beyond polyhedral homotopies. J. Symb. Comput. 91: 173-180 (2019) - 2017
- [j13]Robert Krone, Anton Leykin:
Numerical algorithms for detecting embedded components. J. Symb. Comput. 82: 1-18 (2017) - [j12]Anton Leykin, Daniel Plaumann:
Determinantal representations of hyperbolic curves via polynomial homotopy continuation. Math. Comput. 86(308): 2877-2888 (2017) - 2016
- [j11]Anton Leykin:
Polynomial homotopy continuation in Macaulay2. ACM Commun. Comput. Algebra 50(3): 113-116 (2016) - [j10]Anders Nedergaard Jensen, Anton Leykin, Josephine Yu:
Computing Tropical Curves via Homotopy Continuation. Exp. Math. 25(1): 83-93 (2016) - 2013
- [j9]Carlos Beltrán, Anton Leykin:
Robust Certified Numerical Homotopy Tracking. Found. Comput. Math. 13(2): 253-295 (2013) - 2012
- [j8]Carlos Beltrán, Anton Leykin:
Certified Numerical Homotopy Tracking. Exp. Math. 21(1): 69-83 (2012) - 2010
- [j7]Anton Leykin:
Abstract only: Certified numerical solving of systems of polynomial equations. ACM Commun. Comput. Algebra 44(1/2): 24 (2010) - 2009
- [j6]Anton Leykin, Jan Verschelde:
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm. Int. J. Comput. Sci. Eng. 4(2): 94-101 (2009) - [j5]Anton Leykin, Frank Sottile:
Galois groups of Schubert problems via homotopy computation. Math. Comput. 78(267): 1749-1765 (2009) - 2006
- [j4]Josep Àlvarez Montaner, Anton Leykin:
Computing the support of local cohomology modules. J. Symb. Comput. 41(12): 1328-1344 (2006) - [j3]Anton Leykin, Jan Verschelde, Ailing Zhao:
Newton's method with deflation for isolated singularities of polynomial systems. Theor. Comput. Sci. 359(1-3): 111-122 (2006) - 2004
- [j2]Anton Leykin:
Algorithmic proofs of two theorems of Stafford. J. Symb. Comput. 38(6): 1535-1550 (2004) - 2001
- [j1]Anton Leykin:
Constructibility of the Set of Polynomials with a Fixed Bernstein-Sato Polynomial: an Algorithmic Approach. J. Symb. Comput. 32(6): 663-675 (2001)
Conference and Workshop Papers
- 2023
- [c16]Michael A. Burr, Kisun Lee, Anton Leykin:
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. ISSAC 2023: 126-134 - 2022
- [c15]Petr Hruby, Timothy Duff, Anton Leykin, Tomás Pajdla:
Learning to Solve Hard Minimal Problems. CVPR 2022: 5522-5532 - 2020
- [c14]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: 12070-12080 - [c13]Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla:
PL1P - Point-Line Minimal Problems Under Partial Visibility in Three Views. ECCV (26) 2020: 175-192 - 2019
- [c12]Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla:
PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility. ICCV 2019: 1675-1684 - [c11]Michael A. Burr, Kisun Lee, Anton Leykin:
Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions. ISSAC 2019: 267-274 - 2018
- [c10]Anton Leykin:
Homotopy Continuation in Macaulay2. ICMS 2018: 328-334 - [c9]Nathan Bliss, Timothy Duff, Anton Leykin, Jeff Sommars:
Monodromy Solver: Sequential and Parallel. ISSAC 2018: 87-94 - 2014
- [c8]Thomas Kahle, Robert Krone, Anton Leykin:
Equivariant lattice generators and Markov bases. ISSAC 2014: 264-271 - 2010
- [c7]Christine Berkesch, Anton Leykin:
Algorithms for Bernstein-Sato polynomials and multiplier ideals. ISSAC 2010: 99-106 - 2008
- [c6]Anton Leykin:
Numerical primary decomposition. ISSAC 2008: 165-172 - 2007
- [c5]Anton Leykin, Frank Sottile:
Computing monodromy via parallel homotopy continuation. PASCO 2007: 97-98 - 2006
- [c4]Anton Leykin, Jan Verschelde, Yan Zhuang:
Parallel Homotopy Algorithms to Solve Polynomial Systems. ICMS 2006: 225-234 - [c3]Anton Leykin, Jan Verschelde:
Interfacing with the Numerical Homotopy Algorithms in PHCpack. ICMS 2006: 354-360 - 2005
- [c2]Anton Leykin, Jan Verschelde:
Factoring Solution Sets of Polynomial Systems in Parallel. ICPP Workshops 2005: 173-180 - 2004
- [c1]Anton Leykin:
On Parallel Computation of Gröbner Bases. ICPP Workshops 2004: 160-164
Editorship
- 2024
- [e1]Kevin Buzzard, Alicia Dickenstein, Bettina Eick, Anton Leykin, Yue Ren:
Mathematical Software - ICMS 2024 - 8th International Conference, Durham, UK, July 22-25, 2024, Proceedings. Lecture Notes in Computer Science 14749, Springer 2024, ISBN 978-3-031-64528-0 [contents]
Informal and Other Publications
- 2024
- [i18]Daniel Turizo, Diego Cifuentes, Anton Leykin, Daniel K. Molzahn:
Discrete Shortest Paths in Optimal Power Flow Feasible Regions. CoRR abs/2408.02172 (2024) - 2023
- [i17]Michael A. Burr, Kisun Lee, Anton Leykin:
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. CoRR abs/2302.04776 (2023) - [i16]Daniel J. Bates, Paul Breiding, Tianran Chen, Jonathan D. Hauenstein, Anton Leykin, Frank Sottile:
Numerical Nonlinear Algebra. CoRR abs/2302.08585 (2023) - 2022
- [i15]Timothy Duff, Anton Leykin, Jose Israel Rodriguez:
u-generation: solving systems of polynomials equation-by-equation. CoRR abs/2206.02869 (2022) - 2021
- [i14]Petr Hruby, Timothy Duff, Anton Leykin, Tomás Pajdla:
Learning to Solve Hard Minimal Problems. CoRR abs/2112.03424 (2021) - 2020
- [i13]Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla:
PL1P - Point-line Minimal Problems under Partial Visibility in Three Views. CoRR abs/2003.05015 (2020) - [i12]Justin Chen, Marc Härkönen, Robert Krone, Anton Leykin:
Noetherian operators and primary decomposition. CoRR abs/2006.13881 (2020) - [i11]Michael A. Burr, Anton Leykin:
Inflation of poorly conditioned zeros of systems of analytic functions. CoRR abs/2009.05810 (2020) - 2019
- [i10]Michael A. Burr, Kisun Lee, Anton Leykin:
Effective certification of approximate solutions to systems of equations involving analytic functions. CoRR abs/1901.10384 (2019) - [i9]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 abs/1903.09755 (2019) - [i8]Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla:
PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility. CoRR abs/1903.10008 (2019) - 2018
- [i7]Nathan Bliss, Timothy Duff, Anton Leykin, Jeff Sommars:
Monodromy Solver: Sequential and Parallel. CoRR abs/1805.12212 (2018) - 2017
- [i6]Anton Leykin, Josephine Yu:
Beyond Polyhedral Homotopies. CoRR abs/1706.03520 (2017) - 2016
- [i5]Timothy Duff, Cvetelina Hill, Anders Nedergaard Jensen, Kisun Lee, Anton Leykin, Jeff Sommars:
Solving polynomial systems via homotopy continuation and monodromy. CoRR abs/1609.08722 (2016) - 2013
- [i4]Daniel J. Bates, Elizabeth Gross, Anton Leykin, Jose Israel Rodriguez:
Bertini for Macaulay2. CoRR abs/1310.3297 (2013) - 2011
- [i3]Anton Leykin:
A search for an optimal start system for numerical homotopy continuation. CoRR abs/1105.4324 (2011) - 2009
- [i2]Anton Leykin:
Numerical Algebraic Geometry for Macaulay2. CoRR abs/0911.1783 (2009) - 2005
- [i1]Anton Leykin, Jan Verschelde:
Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm. CoRR abs/cs/0509067 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 01:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
