Mullin, Ron
rmullin@fau.edu
Submitted:
- R.C. Mullin, J. L. Yucas, and G. L. Mullen, A generalized counting and factoring technique for polynomials over finite fields, J. Number Theory, (Feb. 2005) 21 pages.
Published:
- R.C. Mullin and A. Mahalanobis, An alternative representation of finite fields, Utilitas Math 67 (2005) 305-314 .
- R.C. Mullin, A multiplier architecture for user selectable extensions of F2n, Utilitas Math. 63 (2002), 81-87.
- R. C. Mullin, Some involutions on F2[x] with applications to factorization and enumeration, Proc. Combinatorial Number Theory and Algebraic Combinatorics, Yamagata Japan (2002), 46-55.
- H.-D. O. F. Gronau, R. C. Mullin, and A. Rosa, Symmetric graph designs, Graphs Combin.16 (1), (2000), 3-102.
- F. E. Bennett, C.J. Colbourn, and R.C. Mullin, Quintessential pairwise balanced designs, J. Statist. Plann. Infer. 72 (1998), 331 - 345.
- A. C.-H. Ling, X. J. Zhu, C. J. Colbourn, and R. C. Mullin, Pairwise balanced designs with consecutive block sizes, Designs, Codes and Cryptography 10 (1997) 203 – 222.
- I. F. Blake, S. Gao, and R. C. Mullin, Specific irreducible polynomials with linearly independent roots, J. Alg. Applns 257 (1997), 227 – 249.
- H.-D. O. F. Gronau, R. C. Mullin, and A. Rosa, Orthogonal double covers of complete graphs by trees, Graphs and Combinatorics 13 (1997), 251 – 262.
- R. C. Mullin, A. C.-H. Ling, RJR Abel, and F.E. Bennett, On the closure of subsets of {4,5,…,9} which contain {3}, Ars Comb. 47 (1997), 33 – 76.
- R. C. Mullin, H.-D.O.F. Gronau and Ch. Pietsch, The closure of all subsets of {3,4, ...,10} which contain {3}, Ars Combinatoria, 41 (1995), 129-161.
- A. Granville,H.-D.O.F. Gronau, and R. C. Mullin, On a problem of Hering concerning orthogonal double covers of Kn, J. Combin. Theory A, 72 (1995), 345-350. S. Hobart, D.G. Hoffman and R.C. Mullin, Near subgroups of groups. Discrete Math., 146 (1995), 97-108.
- H.D.O.F. Gronau, R. C. Mullin, and P.J. Schellenberg, On orthogonal double covers of Kn and a conjecture of Chung and West, J. Combin. Designs, 3 (1995), 213-231.