default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald C. Mullin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1975
[b1]Ian F. Blake, Ronald C. Mullin:
The mathematical theory of coding. Acad. Press 1975, ISBN 0121035506, pp. I-XI, 1-356
Journal Articles
- 2016
- [j29]Dieter Jungnickel, Jennifer D. Key, Chris J. Mitchell
, Ronald C. Mullin, Peter R. Wild:
Editorial for the 25th anniversary issue. Des. Codes Cryptogr. 78(1): 1-3 (2016) - 2010
- [j28]Ronald C. Mullin, Rainer Steinwandt:
Special issue dedicated to Spyros Magliveras on the occasion of his 70th birthday. Des. Codes Cryptogr. 55(2-3): 103-105 (2010) - 2000
- [j27]Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa, Paul J. Schellenberg:
Symmetric Graph Designs. Graphs Comb. 16(1): 93-102 (2000) - 1997
- [j26]Ronald C. Mullin, Alan C. H. Ling, R. Julian R. Abel, Frank E. Bennett:
On the Closure of Subsets of {4, 5, ..., 9} which contain {4}. Ars Comb. 45 (1997) - [j25]Alan C. H. Ling, Xiaojun Zhu, Charles J. Colbourn, Ronald C. Mullin:
Pairwise Balanced Designs with Consecutive Block Sizes. Des. Codes Cryptogr. 10(2): 203-222 (1997) - [j24]Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa:
Orthogonal Double Covers of Complete Graphs by Trees. Graphs Comb. 13(3): 251-262 (1997) - 1995
- [j23]Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Ch. Pietsch:
The closure of all subsets of {3, 4, ...10} which include 3. Ars Comb. 41 (1995) - [j22]D. G. Hoffman, Sylvia A. Hobart, Ronald C. Mullin:
Near subgroups of groups. Discret. Math. 146(1-3): 97-108 (1995) - [j21]Andrew Granville, Hans-Dietrich O. F. Gronau, Ronald C. Mullin:
On a Problem of Hering Concerning Orthogonal Covers of Kn. J. Comb. Theory A 72(2): 345-350 (1995) - 1994
- [j20]W. H. Mills, Ronald C. Mullin:
On lambda-Covers of Pairs by Quintuples: v Odd. J. Comb. Theory A 67(2): 245-272 (1994) - [j19]Ian F. Blake, Shuhong Gao, Ronald C. Mullin:
Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b. SIAM J. Discret. Math. 7(3): 499-512 (1994) - 1993
- [j18]Ian F. Blake, Shuhong Gao, Ronald C. Mullin:
Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4. Appl. Algebra Eng. Commun. Comput. 4: 89-94 (1993) - [j17]Gordon B. Agnew, Thomas Beth, Ronald C. Mullin, Scott A. Vanstone:
Arithmetic Operations in GF(2m). J. Cryptol. 6(1): 3-13 (1993) - [j16]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
An Implementation of Elliptic Curve Cryptosystems Over F2155. IEEE J. Sel. Areas Commun. 11(5): 804-813 (1993) - 1991
- [j15]Ronald C. Mullin, Dan Wevrick:
Singular points in pair covers and their relation to Hadamard designs. Discret. Math. 92(1-3): 221-225 (1991) - [j14]Dieter Jungnickel, Ronald C. Mullin, Scott A. Vanstone:
The spectrum of alpha-resolvable block designs with block size 3. Discret. Math. 97(1-3): 269-277 (1991) - [j13]Gordon B. Agnew, Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone:
An Implementation for a Fast Public-Key Cryptosystem. J. Cryptol. 3(2): 63-79 (1991) - 1990
- [j12]Ronald C. Mullin, Douglas R. Stinson:
Pairwise balanced designs with odd block sizes exceeding five. Discret. Math. 84(1): 47-62 (1990) - 1989
- [j11]Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone, R. M. Wilson:
Optimal normal bases in GF(pn). Discret. Appl. Math. 22(2): 149-161 (1989) - [j10]Ronald C. Mullin:
Finite bases for some PBD-closed sets. Discret. Math. 77(1-3): 217-236 (1989) - 1988
- [j9]W. H. Mills, Ronald C. Mullin:
Covering pairs by quintuples: The case v congruent to 3 (mod 4). J. Comb. Theory A 49(2): 308-322 (1988) - 1987
- [j8]Ronald C. Mullin, Douglas R. Stinson:
Pairwise balanced designs with block sizes 6t + 1. Graphs Comb. 3(1): 365-377 (1987) - [j7]Esther R. Lamken, W. H. Mills, Ronald C. Mullin, Scott A. Vanstone:
Coverings of Pairs by Quintuples. J. Comb. Theory A 44(1): 49-68 (1987) - 1986
- [j6]Alan Hartman, W. H. Mills, Ronald C. Mullin:
Covering triples by quadruples: An asymptotic solution. J. Comb. Theory A 41(1): 117-138 (1986) - 1983
- [j5]Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson:
Finite linear spaces and projective planes. Discret. Math. 47: 49-62 (1983) - 1981
- [j4]Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis:
On the existence of frames. Discret. Math. 37(1): 79-104 (1981) - 1980
- [j3]Ronald C. Mullin:
A Generalization of the Singular Direct Product with Applications Skew Room Squares. J. Comb. Theory A 29(3): 306-318 (1980) - 1979
- [j2]Ronald C. Mullin, Charles Curtis Lindner:
Lower Bounds for Maximal Partial Parallel Classes in Steiner Systems. J. Comb. Theory A 26(3): 314-318 (1979) - 1974
- [j1]Vinton G. Cerf, Donald D. Cowan, Ronald C. Mullin, R. G. Stanton:
A lower bound on the average shortest path length in regular graphs. Networks 4(4): 335-342 (1974)
Conference and Workshop Papers
- 1992
- [c5]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
On the Development of a Fast Elliptic Curve Cryptosystem. EUROCRYPT 1992: 482-487 - 1989
- [c4]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
A Fast Elliptic Curve Cryptosystem. EUROCRYPT 1989: 706-708 - 1988
- [c3]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
An Interactive Data Exchange Protocol Based on Discrete Exponentiation. EUROCRYPT 1988: 159-166 - [c2]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
Fast Exponentiation in GF(2n). EUROCRYPT 1988: 251-255 - 1984
- [c1]Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone:
Computing Logarithms in GF(2n). CRYPTO 1984: 73-82
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
