Ronald C. Mullin

35 papers A* 5Journal 29
YearRankTypeTitle / Venue / Authors
2016 J jnl
Editorial for the 25th anniversary issue.
Des. Codes Cryptogr.
Dieter Jungnickel, Jennifer D. Key, Chris J. Mitchell, Ronald C. Mullin, Peter R. Wild
2010 J jnl
Special issue dedicated to Spyros Magliveras on the occasion of his 70th birthday.
Des. Codes Cryptogr.
Ronald C. Mullin, Rainer Steinwandt
2000 J jnl
Symmetric Graph Designs.
Graphs Comb.
Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa, Paul J. Schellenberg
1997 J jnl
On the Closure of Subsets of {4, 5, ..., 9} which contain {4}.
Ars Comb.
Ronald C. Mullin, Alan C. H. Ling, R. Julian R. Abel, Frank E. Bennett
1997 J jnl
Orthogonal Double Covers of Complete Graphs by Trees.
Graphs Comb.
Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa
1997 J jnl
Pairwise Balanced Designs with Consecutive Block Sizes.
Des. Codes Cryptogr.
Alan C. H. Ling, Xiaojun Zhu, Charles J. Colbourn, Ronald C. Mullin
1995 J jnl
Near subgroups of groups.
Discret. Math.
D. G. Hoffman, Sylvia A. Hobart, Ronald C. Mullin
1995 J jnl
On a Problem of Hering Concerning Orthogonal Covers of K
J. Comb. Theory A
Andrew Granville, Hans-Dietrich O. F. Gronau, Ronald C. Mullin
1995 J jnl
The closure of all subsets of {3, 4, ...10} which include 3.
Ars Comb.
Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Ch. Pietsch
1994 J jnl
Normal and Self-dual Normal Bases from Factorization of c x
SIAM J. Discret. Math.
Ian F. Blake, Shuhong Gao, Ronald C. Mullin
1994 J jnl
On lambda-Covers of Pairs by Quintuples: v Odd.
J. Comb. Theory A
W. H. Mills, Ronald C. Mullin
1993 J jnl
An Implementation of Elliptic Curve Cryptosystems Over F
IEEE J. Sel. Areas Commun.
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
1993 J jnl
Arithmetic Operations in GF(2
J. Cryptol.
Gordon B. Agnew, Thomas Beth, Ronald C. Mullin, Scott A. Vanstone
1993 J jnl
Explicit Factorization of x
Appl. Algebra Eng. Commun. Comput.
Ian F. Blake, Shuhong Gao, Ronald C. Mullin
1992 A* conf
On the Development of a Fast Elliptic Curve Cryptosystem.
EUROCRYPT
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
1991 J jnl
An Implementation for a Fast Public-Key Cryptosystem.
J. Cryptol.
Gordon B. Agnew, Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone
1991 J jnl
Singular points in pair covers and their relation to Hadamard designs.
Discret. Math.
Ronald C. Mullin, Dan Wevrick
1991 J jnl
The spectrum of alpha-resolvable block designs with block size 3.
Discret. Math.
Dieter Jungnickel, Ronald C. Mullin, Scott A. Vanstone
1990 J jnl
Pairwise balanced designs with odd block sizes exceeding five.
Discret. Math.
Ronald C. Mullin, Douglas R. Stinson
1989 A* conf
A Fast Elliptic Curve Cryptosystem.
EUROCRYPT
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
1989 J jnl
Finite bases for some PBD-closed sets.
Discret. Math.
Ronald C. Mullin
1989 J jnl
Optimal normal bases in GF(p
Discret. Appl. Math.
Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone, R. M. Wilson
1988 A* conf
An Interactive Data Exchange Protocol Based on Discrete Exponentiation.
EUROCRYPT
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
1988 J jnl
Covering pairs by quintuples: The case
J. Comb. Theory A
W. H. Mills, Ronald C. Mullin
1988 A* conf
Fast Exponentiation in
EUROCRYPT
Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
1987 J jnl
Coverings of Pairs by Quintuples.
J. Comb. Theory A
Esther R. Lamken, W. H. Mills, Ronald C. Mullin, Scott A. Vanstone
1987 J jnl
Pairwise balanced designs with block sizes 6
Graphs Comb.
Ronald C. Mullin, Douglas R. Stinson
1986 J jnl
Covering triples by quadruples: An asymptotic solution.
J. Comb. Theory A
Alan Hartman, W. H. Mills, Ronald C. Mullin
1984 A* conf
Computing Logarithms in GF(2
CRYPTO
Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone
1983 J jnl
Finite linear spaces and projective planes.
Discret. Math.
Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson
1981 J jnl
On the existence of frames.
Discret. Math.
Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis
1980 J jnl
A Generalization of the Singular Direct Product with Applications Skew Room Squares.
J. Comb. Theory A
Ronald C. Mullin
1979 J jnl
Lower Bounds for Maximal Partial Parallel Classes in Steiner Systems.
J. Comb. Theory A
Ronald C. Mullin, Charles Curtis Lindner
1975 — book
The mathematical theory of coding.
Ian F. Blake, Ronald C. Mullin
1974 J jnl
A lower bound on the average shortest path length in regular graphs.
Networks
Vinton G. Cerf, Donald D. Cowan, Ronald C. Mullin, R. G. Stanton