The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ronald C. Mullin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone
    Computing Logarithms in GF(2n). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:73-82 [Conf]
  2. Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
    An Interactive Data Exchange Protocol Based on Discrete Exponentiation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1988, pp:159-166 [Conf]
  3. Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
    Fast Exponentiation in GF(2n). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1988, pp:251-255 [Conf]
  4. Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
    A Fast Elliptic Curve Cryptosystem. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:706-708 [Conf]
  5. Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
    On the Development of a Fast Elliptic Curve Cryptosystem. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:482-487 [Conf]
  6. Ian F. Blake, Shuhong Gao, Ronald C. Mullin
    Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1993, v:4, n:, pp:89-94 [Journal]
  7. 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}. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:45, n:, pp:- [Journal]
  8. Alan C. H. Ling, Xiaojun Zhu, Charles J. Colbourn, Ronald C. Mullin
    Pairwise Balanced Designs with Consecutive Block Sizes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:10, n:2, pp:203-222 [Journal]
  9. Andrew Granville, Hans-Dietrich O. F. Gronau, Ronald C. Mullin
    On a Problem of Hering Concerning Orthogonal Covers of Kn. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:72, n:2, pp:345-350 [Journal]
  10. A. Hartman, W. H. Mills, Ronald C. Mullin
    Covering triples by quadruples: An asymptotic solution. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:1, pp:117-138 [Journal]
  11. Esther R. Lamken, W. H. Mills, Ronald C. Mullin, Scott A. Vanstone
    Coverings of Pairs by Quintuples. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:44, n:1, pp:49-68 [Journal]
  12. W. H. Mills, Ronald C. Mullin
    Covering pairs by quintuples: The case v congruent to 3 (mod 4). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:308-322 [Journal]
  13. W. H. Mills, Ronald C. Mullin
    On lambda-Covers of Pairs by Quintuples: v Odd. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:67, n:2, pp:245-272 [Journal]
  14. Ronald C. Mullin
    A Generalization of the Singular Direct Product with Applications Skew Room Squares. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:3, pp:306-318 [Journal]
  15. Ronald C. Mullin, Charles Curtis Lindner
    Lower Bounds for Maximal Partial Parallel Classes in Steiner Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:26, n:3, pp:314-318 [Journal]
  16. Gordon B. Agnew, Thomas Beth, Ronald C. Mullin, Scott A. Vanstone
    Arithmetic Operations in GF(2m). [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:1, pp:3-13 [Journal]
  17. Gordon B. Agnew, Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone
    An Implementation for a Fast Public-Key Cryptosystem. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1991, v:3, n:2, pp:63-79 [Journal]
  18. Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
    An Implementation of Elliptic Curve Cryptosystems Over F2155. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1993, v:11, n:5, pp:804-813 [Journal]
  19. Ian F. Blake, Shuhong Gao, Ronald C. Mullin
    Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:499-512 [Journal]
  20. Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis
    On the existence of frames. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:1, pp:79-104 [Journal]
  21. Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson
    Finite linear spaces and projective planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:49-62 [Journal]
  22. Ronald C. Mullin
    Finite bases for some PBD-closed sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:77, n:1-3, pp:217-236 [Journal]
  23. Ronald C. Mullin, Douglas R. Stinson
    Pairwise balanced designs with odd block sizes exceeding five. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:47-62 [Journal]
  24. Ronald C. Mullin, Dan Wevrick
    Singular points in pair covers and their relation to Hadamard designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:92, n:1-3, pp:221-225 [Journal]
  25. Dieter Jungnickel, Ronald C. Mullin, Scott A. Vanstone
    The spectrum of alpha-resolvable block designs with block size 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:97, n:1-3, pp:269-277 [Journal]
  26. D. G. Hoffman, Sylvia A. Hobart, Ronald C. Mullin
    Near subgroups of groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:97-108 [Journal]

  27. Optimal normal bases in GF(pn). [Citation Graph (, )][DBLP]


Search in 0.081secs, Finished in 0.382secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002