From Polynominals to Galois Groups. - David Ford 001; John McKay 001 (European Conference on Computer Algebra (2), 1985)

The Construction of Maximal Orders Over a Dedekind Domain. - David J. Ford (J. Symb. Comput., 1987)

On p-adic Computation of the Rational Form of a Matrix. - Marie-Hélène Mathieu; David Ford 001 (J. Symb. Comput., 1990)

The Totally Real A5 Extension of Degree 6 with Minimum Discriminant. - David Ford 001; Michael Pohst (Exp. Math., 1992)

On Wendt's Determinant and Sophie Germain's Theorem. - David Ford 001; Vijay Jha (Exp. Math., 1993)

The Totally Real A6 Extension of Degree 6 with Minimum Discriminant. - David J. Ford; Michael E. Pohst (Exp. Math., 1993)

Minimum Discriminants of Primitive Sextic Fields. - David Ford 001 (ANTS, 1996)

A New Algorithm and Refined Bounds for Extended Gcd Computation. - David Ford 001; George Havas (ANTS, 1996)

Determinants of Latin Squares of Order 8. - David Ford 001; Kenneth W. Johnson (Exp. Math., 1996)

Ideal Decompositions and Subfields. - David Casperson; David Ford 001; John McKay 001 (J. Symb. Comput., 1996)

The S5 Extensions of Degree 6 with Minimum Discriminant. - David Ford 001; Michael Pohst; Mario Daberkow; Nasser Haddad (Exp. Math., 1998)

On the Complexity of the Montes Ideal Factorization Algorithm. - David Ford 001; Olga Veres (ANTS, 2010)