| Learning to Solve Hard Minimal Problems | 0 | 0.34 | 2022 |
| Noetherian operators and primary decomposition | 0 | 0.34 | 2022 |
| A Numerical Toolkit For Multiprojective Varieties | 0 | 0.34 | 2021 |
| TRPLP – Trifocal Relative Pose From Lines at Points | 0 | 0.34 | 2020 |
| PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility. | 2 | 0.35 | 2019 |
| Trifocal Relative Pose from Lines at Points and its Efficient Solution. | 0 | 0.34 | 2019 |
| Beyond Polyhedral Homotopies. | 0 | 0.34 | 2019 |
| Effective certification of approximate solutions to systems of equations involving analytic functions. | 0 | 0.34 | 2019 |
| Plmp - Point-Line Minimal Problems In Complete Multi-View Visibility | 0 | 0.34 | 2019 |
| Homotopy Continuation in Macaulay2. | 0 | 0.34 | 2018 |
| Monodromy Solver: Sequential And Parallel | 0 | 0.34 | 2018 |
| Determinantal representations of hyperbolic curves via polynomial homotopy continuation | 1 | 0.36 | 2017 |
| Numerical algorithms for detecting embedded components. | 1 | 0.37 | 2017 |
| Solving Polynomial Systems Via Homotopy Continuation And Monodromy | 4 | 0.46 | 2016 |
| Polynomial homotopy continuation in Macaulay2. | 0 | 0.34 | 2016 |
| Computing Tropical Curves via Homotopy Continuation. | 0 | 0.34 | 2016 |
| Equivariant lattice generators and Markov bases | 2 | 0.53 | 2014 |
| Robust Certified Numerical Homotopy Tracking. | 6 | 0.46 | 2013 |
| Bertini for Macaulay2. | 0 | 0.34 | 2013 |
| Certified Numerical Homotopy Tracking. | 10 | 0.68 | 2012 |
| Algorithms for Bernstein--Sato polynomials and multiplier ideals | 0 | 0.34 | 2010 |
| Abstract only: Certified numerical solving of systems of polynomial equations | 0 | 0.34 | 2010 |
| Numerical Algebraic Geometry for Macaulay2 | 7 | 0.57 | 2009 |
| Galois groups of Schubert problems via homotopy computation | 14 | 0.91 | 2009 |
| Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm | 10 | 0.64 | 2009 |
| Numerical primary decomposition | 7 | 0.65 | 2008 |
| Computing monodromy via parallel homotopy continuation | 1 | 0.37 | 2007 |
| Computing the support of local cohomology modules | 0 | 0.34 | 2006 |
| Newton's method with deflation for isolated singularities of polynomial systems | 61 | 3.07 | 2006 |
| Interfacing with the numerical homotopy algorithms in PHCpack | 9 | 0.68 | 2006 |
| Parallel homotopy algorithms to solve polynomial systems | 13 | 0.85 | 2006 |
| Factoring Solution Sets of Polynomial Systems in Parallel | 10 | 0.62 | 2005 |
| Algorithmic proofs of two theorems of Stafford | 4 | 0.49 | 2004 |
| On Parallel Computation of Gröbner Bases | 6 | 0.79 | 2004 |
| Constructibility of the set of polynomials with a fixed Bernstein-Sato polynonmial: an algorithmic approach | 5 | 0.73 | 2001 |
