 | 2011 |
| 16 |  | Anton Leykin:
A search for an optimal start system for numerical homotopy continuation
CoRR abs/1105.4324: (2011) |
| 2010 |
| 15 |  | Christine Berkesch,
Anton Leykin:
Algorithms for Bernstein-Sato polynomials and multiplier ideals.
ISSAC 2010: 99-106 |
| 2009 |
| 14 |  | Anton Leykin:
Numerical Algebraic Geometry for Macaulay2
CoRR abs/0911.1783: (2009) |
| 13 |  | Anton Leykin,
Jan Verschelde:
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm.
IJCSE 4(2): 94-101 (2009) |
| 12 |  | Anton Leykin,
Frank Sottile:
Galois groups of Schubert problems via homotopy computation.
Math. Comput. 78(267): 1749-1765 (2009) |
| 2008 |
| 11 |  | Anton Leykin:
Numerical primary decomposition.
ISSAC 2008: 165-172 |
| 2007 |
| 10 |  | Anton Leykin,
Frank Sottile:
Computing monodromy via parallel homotopy continuation.
PASCO 2007: 97-98 |
| 2006 |
| 9 |  | Anton Leykin,
Jan Verschelde,
Yan Zhuang:
Parallel Homotopy Algorithms to Solve Polynomial Systems.
ICMS 2006: 225-234 |
| 8 |  | Anton Leykin,
Jan Verschelde:
Interfacing with the Numerical Homotopy Algorithms in PHCpack.
ICMS 2006: 354-360 |
| 7 |  | Josep Àlvarez Montaner,
Anton Leykin:
Computing the support of local cohomology modules.
J. Symb. Comput. 41(12): 1328-1344 (2006) |
| 6 |  | 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) |
| 2005 |
| 5 |  | Anton Leykin,
Jan Verschelde:
Factoring Solution Sets of Polynomial Systems in Parallel.
ICPP Workshops 2005: 173-180 |
| 4 |  | Anton Leykin,
Jan Verschelde:
Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm
CoRR abs/cs/0509067: (2005) |
| 2004 |
| 3 |  | Anton Leykin:
On Parallel Computation of Gröbner Bases.
ICPP Workshops 2004: 160-164 |
| 2 |  | Anton Leykin:
Algorithmic proofs of two theorems of Stafford.
J. Symb. Comput. 38(6): 1535-1550 (2004) |
| 2001 |
| 1 |  | 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) |