John D. Dixon

11 papers Journal 9Unranked 2

Year	Rank	Type	Title / Venue / Authors
2014	J	`jnl`	An Eigenvalue Theorem for Systems of Polynomial Equations. Am. Math. Mon. Yuly Billig, John D. Dixon
2013	J	`jnl`	Computing characters of groups with central subgroups. LMS J. Comput. Math. Vahid Dabbaghian, John D. Dixon
2010	J	`jnl`	Computing matrix representations. Math. Comput. Vahid Dabbaghian, John D. Dixon
2008	J	`jnl`	Generating Random Elements in Finite Groups. Electron. J. Comb. John D. Dixon
2005	J	`jnl`	Asymptotics of Generating the Symmetric and Alternating Groups. Electron. J. Comb. John D. Dixon
2004	J	`jnl`	The Degree of the Splitting Field of a Random Polynomial over a Finite Field. Electron. J. Comb. John D. Dixon, Daniel Panario
1992	J	`jnl`	Random sets which invariably generate the symmetric group. Discret. Math. John D. Dixon
1991	—	`conf`	Constructing Representations of Finite Groups. Groups And Computation John D. Dixon
1983	J	`jnl`	The Random Selection of Unlabeled Graphs. J. Algorithms John D. Dixon, Herbert S. Wilf
1975	J	`jnl`	Monotonic subsequences in random sequences. Discret. Math. John D. Dixon
1971	—	`conf`	Permutation representations and the subgroup lattice. SYMSAC John D. Dixon