Anton Leykin Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton Leykin: Numerical primary decomposition. ISSAC 2008: 165-172
2007
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton Leykin, Frank Sottile: Computing monodromy via parallel homotopy continuation. PASCO 2007: 97-98
2006
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton Leykin, Jan Verschelde, Yan Zhuang: Parallel Homotopy Algorithms to Solve Polynomial Systems. ICMS 2006: 225-234
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton Leykin, Jan Verschelde: Interfacing with the Numerical Homotopy Algorithms in PHCpack. ICMS 2006: 354-360
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosep Àlvarez Montaner, Anton Leykin: Computing the support of local cohomology modules. J. Symb. Comput. 41(12): 1328-1344 (2006)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton Leykin, Jan Verschelde: Factoring Solution Sets of Polynomial Systems in Parallel. ICPP Workshops 2005: 173-180
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton Leykin, Jan Verschelde: Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm CoRR abs/cs/0509067: (2005)
2004
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton Leykin: On Parallel Computation of Gröbner Bases. ICPP Workshops 2004: 160-164
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton Leykin: Algorithmic proofs of two theorems of Stafford. J. Symb. Comput. 38(6): 1535-1550 (2004)
2001
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnton Leykin: Constructibility of the Set of Polynomials with a Fixed Bernstein-Sato Polynomial: an Algorithmic Approach. J. Symb. Comput. 32(6): 663-675 (2001)

Coauthor Index

1Josep Àlvarez Montaner [7]
2Frank Sottile [10]
3Jan Verschelde [4] [5] [6] [8] [9]
4Ailing Zhao [6]
5Yan Zhuang [9]

Colors in the list of coauthors

Copyright © Mon Nov 30 15:58:31 2009 by Michael Ley (ley@uni-trier.de)