Showing 17 results

Archival description
Mullin, Ronald Cleveland
Print preview View:
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.
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.
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.
First convocation.
First convocation.
Waterloo University, First Convocation
Waterloo University, First Convocation
Professor Ron Mullin, Combinatorics and Optimization.
Professor Ron Mullin, Combinatorics and Optimization.
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.
University of Waterloo, research into computer security systems, Blake, Mullin, and Vanstone
University of Waterloo, research into computer security systems, Blake, Mullin, and Vanstone
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.
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.
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.
Ron Mullin, Combinatorics and Optimization.
Ron Mullin, Combinatorics and Optimization.