John D. Dixon

According to our database, John D. Dixon authored at least 11 papers between 1971 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2014

An Eigenvalue Theorem for Systems of Polynomial Equations.

Yuly Billig, John D. Dixon

Am. Math. Mon., 2014

2013

Computing characters of groups with central subgroups.

Vahid Dabbaghian, John D. Dixon

LMS J. Comput. Math., 2013

2010

Computing matrix representations.

Vahid Dabbaghian, John D. Dixon

Math. Comput., 2010

2008

Generating Random Elements in Finite Groups.

John D. Dixon

Electron. J. Comb., 2008

2005

Asymptotics of Generating the Symmetric and Alternating Groups.

John D. Dixon

Electron. J. Comb., 2005

2004

The Degree of the Splitting Field of a Random Polynomial over a Finite Field.

John D. Dixon, Daniel Panario

Electron. J. Comb., 2004

1992

Random sets which invariably generate the symmetric group.

John D. Dixon

Discret. Math., 1992

1991

Constructing Representations of Finite Groups.

John D. Dixon

Proceedings of the Groups And Computation, 1991

1983

The Random Selection of Unlabeled Graphs.

John D. Dixon, Herbert S. Wilf

J. Algorithms, 1983

1975

Monotonic subsequences in random sequences.

John D. Dixon

Discret. Math., 1975

1971

Permutation representations and the subgroup lattice.

John D. Dixon

Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, 1971