![]() |
| 2008 | ||
|---|---|---|
| 11 | EE | Anton Leykin: Numerical primary decomposition. ISSAC 2008: 165-172 |
| 2007 | ||
| 10 | EE | Anton Leykin, Frank Sottile: Computing monodromy via parallel homotopy continuation. PASCO 2007: 97-98 |
| 2006 | ||
| 9 | EE | Anton Leykin, Jan Verschelde, Yan Zhuang: Parallel Homotopy Algorithms to Solve Polynomial Systems. ICMS 2006: 225-234 |
| 8 | EE | Anton Leykin, Jan Verschelde: Interfacing with the Numerical Homotopy Algorithms in PHCpack. ICMS 2006: 354-360 |
| 7 | EE | Josep Àlvarez Montaner, Anton Leykin: Computing the support of local cohomology modules. J. Symb. Comput. 41(12): 1328-1344 (2006) |
| 6 | EE | 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 | EE | Anton Leykin, Jan Verschelde: Factoring Solution Sets of Polynomial Systems in Parallel. ICPP Workshops 2005: 173-180 |
| 4 | EE | Anton Leykin, Jan Verschelde: Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm CoRR abs/cs/0509067: (2005) |
| 2004 | ||
| 3 | EE | Anton Leykin: On Parallel Computation of Gröbner Bases. ICPP Workshops 2004: 160-164 |
| 2 | EE | Anton Leykin: Algorithmic proofs of two theorems of Stafford. J. Symb. Comput. 38(6): 1535-1550 (2004) |
| 2001 | ||
| 1 | EE | 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) |
| 1 | Josep Àlvarez Montaner | [7] |
| 2 | Frank Sottile | [10] |
| 3 | Jan Verschelde | [4] [5] [6] [8] [9] |
| 4 | Ailing Zhao | [6] |
| 5 | Yan Zhuang | [9] |