Search the dblp DataBase

Publications of Author

1. Anton Leykin, Jan Verschelde
   Interfacing with the Numerical Homotopy Algorithms in PHCpack. [Citation Graph (0, 0)][DBLP]
   ICMS, 2006, pp:354-360 [Conf]
   
2. Anton Leykin, Jan Verschelde, Yan Zhuang
   Parallel Homotopy Algorithms to Solve Polynomial Systems. [Citation Graph (0, 0)][DBLP]
   ICMS, 2006, pp:225-234 [Conf]
   
3. Anton Leykin
   On Parallel Computation of Gröbner Bases. [Citation Graph (0, 0)][DBLP]
   ICPP Workshops, 2004, pp:160-164 [Conf]
   
4. Anton Leykin, Jan Verschelde
   Factoring Solution Sets of Polynomial Systems in Parallel. [Citation Graph (0, 0)][DBLP]
   ICPP Workshops, 2005, pp:173-180 [Conf]
   
5. Anton Leykin
   Constructibility of the Set of Polynomials with a Fixed Bernstein-Sato Polynomial: an Algorithmic Approach. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2001, v:32, n:6, pp:663-675 [Journal]
   
6. Anton Leykin
   Algorithmic proofs of two theorems of Stafford. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2004, v:38, n:6, pp:1535-1550 [Journal]
   
7. Josep Àlvarez Montaner, Anton Leykin
   Computing the support of local cohomology modules. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2006, v:41, n:12, pp:1328-1344 [Journal]
   
8. Anton Leykin, Jan Verschelde, Ailing Zhao
   Newton's method with deflation for isolated singularities of polynomial systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:359, n:1-3, pp:111-122 [Journal]
   
9. 
   Computing monodromy via parallel homotopy continuation. [Citation Graph (, )][DBLP]
   
   
10. 
    Numerical primary decomposition. [Citation Graph (, )][DBLP]
    
    
11. 
    Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm [Citation Graph (, )][DBLP]
    
    
12. 
    Numerical Algebraic Geometry for Macaulay2 [Citation Graph (, )][DBLP]