| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 5 |      | Michael Filaseta, Michael J. Mossinghoff: The distance to an irreducible polynomial, II. Math. Comput. 81(279): (2012) |
| 2005 | ||
| 4 | | Michael Filaseta, Douglas B. Meade: Irreducibility testing of lacunary 0, 1-polynomials. J. Algorithms 55(1): 21-28 (2005) |
| 2004 | ||
| 3 | | Michael Filaseta, Andrzej Schinzel: On testing the divisibility of lacunary polynomials by cyclotomic polynomials. Math. Comput. 73(246): 957-965 (2004) |
| 1994 | ||
| 2 | | Michael Filaseta, M. L. Robinson, Ferrell S. Wheeler: The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable. J. Algorithms 16(2): 309-333 (1994) |
| 1985 | ||
| 1 | | Michael Filaseta: A New Method for Solving a Class of Ballot Problems. J. Comb. Theory, Ser. A 39(1): 102-111 (1985) |
| 1 | Douglas B. Meade | [4] |
| 2 | Michael J. Mossinghoff | [5] |
| 3 | M. L. Robinson | [2] |
| 4 | Andrzej Schinzel | [3] |
| 5 | Ferrell S. Wheeler | [2] |
Colors in the list of coauthors
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page