Waterloo University, First Convocation
Waterloo University, First Convocation
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.
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.
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.
First convocation.
First convocation.
Mullin, Professor R. C., Math.
Mullin, Professor R. C., Math.
R. Mullin, Combinatorics and Optimization.
R. Mullin, Combinatorics and Optimization.
Dr. Ron Mullin.
Dr. Ron Mullin.
Professor Ron Mullin, Combinatorics and Optimization.
Professor Ron Mullin, Combinatorics and Optimization.
Ron Mullin, Combinatorics and Optimization.
Ron Mullin, Combinatorics and Optimization.
Cryptography group - Ron Mullin, Scott Vanstone, Gord Agnew and Ian Blake.
Cryptography group - Ron Mullin, Scott Vanstone, Gord Agnew and Ian Blake.
University of Waterloo, research into computer security systems, Blake, Mullin, and Vanstone
University of Waterloo, research into computer security systems, Blake, Mullin, and Vanstone
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.
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.
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.
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.
