Permutation representations and the subgroup lattice. - John D. Dixon (SYMSAC, 1971)

Monotonic subsequences in random sequences. - John D. Dixon (Discret. Math., 1975)

The Random Selection of Unlabeled Graphs. - John D. Dixon; Herbert S. Wilf (J. Algorithms, 1983)

Constructing Representations of Finite Groups. - John D. Dixon (Groups And Computation, 1991)

Random sets which invariably generate the symmetric group. - John D. Dixon (Discret. Math., 1992)

The Degree of the Splitting Field of a Random Polynomial over a Finite Field. - John D. Dixon; Daniel Panario (Electron. J. Comb., 2004)

Asymptotics of Generating the Symmetric and Alternating Groups. - John D. Dixon (Electron. J. Comb., 2005)

Generating Random Elements in Finite Groups. - John D. Dixon (Electron. J. Comb., 2008)

Computing matrix representations. - Vahid Dabbaghian; John D. Dixon (Math. Comput., 2010)

Computing characters of groups with central subgroups. - Vahid Dabbaghian; John D. Dixon (LMS J. Comput. Math., 2013)

An Eigenvalue Theorem for Systems of Polynomial Equations. - Yuly Billig; John D. Dixon (Am. Math. Mon., 2014)