Construction of the generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Construction of the generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Counting algorithms for connected labelled graphs / D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Counting algorithms for connected labelled graphs / D.D. Cowan, R.C. Mullin, and R.G. Stanton.
R. Mullin, Combinatorics and Optimization.
R. Mullin, Combinatorics and Optimization.
Computer networks and generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Computer networks and generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Mullin, Professor R. C., Math.
Mullin, Professor R. C., Math.
University of Waterloo encryptors, Gord Agnew, Ron Mullin and Scott Vanstone, with microchip.
University of Waterloo encryptors, Gord Agnew, Ron Mullin and Scott Vanstone, with microchip.
University of Waterloo, research into computer security systems, Blake, Mullin, and Vanstone
University of Waterloo, research into computer security systems, Blake, Mullin, and Vanstone
The generalized Petersen graph / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
The generalized Petersen graph / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
The growth of network cost as a function of network size / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
The growth of network cost as a function of network size / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Cryptography group - Ron Mullin, Scott Vanstone, Gord Agnew and Ian Blake.
Cryptography group - Ron Mullin, Scott Vanstone, Gord Agnew and Ian Blake.
A partial census of trivalent generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
A partial census of trivalent generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Professor Ron Mullin, Combinatorics and Optimization.
Professor Ron Mullin, Combinatorics and Optimization.
Dr. Ron Mullin.
Dr. Ron Mullin.
Waterloo University, First Convocation
Waterloo University, First Convocation
First convocation.
First convocation.
Some unique extremal graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Some unique extremal graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Ron Mullin, Combinatorics and Optimization.
Ron Mullin, Combinatorics and Optimization.
