A New Method for Solving a Class of Ballot Problems. - Michael Filaseta (J. Comb. Theory A, 1985)

The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable. - Michael Filaseta; M. L. Robinson; Ferrell S. Wheeler (J. Algorithms, 1994)

When a Multiple of π/2 is Close to an Integer: 10640. - Michael Filaseta; Allen Stenger; David Callan; Zachary Franco (Am. Math. Mon., 2000)

A distribution problem for powerfree values of irreducible polynomials. - Brian Beasley; Michael Filaseta (Period. Math. Hung., 2001)

On testing the divisibility of lacunary polynomials by cyclotomic polynomials. - Michael Filaseta; Andrzej Schinzel (Math. Comput., 2004)

Irreducibility testing of lacunary 0, 1-polynomials. - Michael Filaseta; Douglas B. Meade (J. Algorithms, 2005)

The distance to an irreducible polynomial, II. - Michael Filaseta; Michael J. Mossinghoff (Math. Comput., 2012)

Primes that become composite after changing an arbitrary digit. - Michael Filaseta; Jeremiah Southwick (Math. Comput., 2021)