Print preview Close

Showing 9 results

Archival description
University of Waterloo. Special Collections & Archives Mullin, Ronald Cleveland
Print preview View:
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.
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.
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.
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.
University of Waterloo, research into computer security systems, Blake, Mullin, and Vanstone
University of Waterloo, research into computer security systems, Blake, Mullin, and Vanstone
Waterloo University, First Convocation
Waterloo University, 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.
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.
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.