The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gary L. Mullen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrew T. Clayman, Gary L. Mullen
    Improved (T, M, S)-net Parameters from the Gilbert-Varshamov Bound. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:6, pp:491-496 [Journal]
  2. Stephen D. Cohen, Gary L. Mullen
    Primitive Elements in Finite Fields and Costas Arrays. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1991, v:2, n:, pp:45-53 [Journal]
  3. Stephen D. Cohen, Gary L. Mullen
    Primitive Elements in Finite Fields and Costas Arrays. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1991, v:2, n:, pp:297-299 [Journal]
  4. Arnold Knopfmacher, J. N. Ridley, Gary L. Mullen
    Nets and Sequences Obtained from Irreducible Polynomials Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1998, v:9, n:3, pp:265-269 [Journal]
  5. Ilene H. Morgan, Gary L. Mullen, Miodrag Zivkovic
    Almost Weakly Self-Dual Bases for Finite Fields. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1996, v:8, n:1, pp:25-31 [Journal]
  6. G. Meletiou, Gary L. Mullen
    A Note on Discrete Logarithms in Finite Fields. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1992, v:3, n:, pp:75-78 [Journal]
  7. Charles Laywine, Gary L. Mullen
    A hierarchy of complete orthogonal structures. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:63, n:, pp:- [Journal]
  8. Charles Laywine, Gary L. Mullen
    A Table of Lower Bounds for the Number of Mutually Orthogonal Frequency Squares. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:59, n:, pp:- [Journal]
  9. James A. Sellers, Andrew V. Sills, Gary L. Mullen
    Bijections and Congruences for Generalizations of Partition Identities of Euler and Guy. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  10. Béla Bajnok, Steven B. Damelin, Jenny X. Li, Gary L. Mullen
    A Constructive Finite Field Method for Scattering Points on the Surface of d-Dimensional Spheres. [Citation Graph (0, 0)][DBLP]
    Computing, 2002, v:68, n:2, pp:97-109 [Journal]
  11. Mulan Liu, Gary L. Mullen
    Irreducible Polynomials and Linear Recurring Arrays. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:1, pp:93-99 [Journal]
  12. G. B. Belyavskaya, V. I. Izbash, Gary L. Mullen
    Check Character Systems using Quasigroups: I. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:37, n:2, pp:215-227 [Journal]
  13. Joseph L. Yucas, Gary L. Mullen
    Self-Reciprocal Irreducible Polynomials Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:33, n:3, pp:275-281 [Journal]
  14. Bo Cheng, Gary L. Mullen
    Constructions for mutually orthogonal frequency hyperrectangles with a prescribed type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:55-64 [Journal]
  15. A. Donald Keedwell, Gary L. Mullen
    Sets of partially orthogonal latin squares and projective planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:288, n:1-3, pp:49-60 [Journal]
  16. Joseph L. Yucas, Gary L. Mullen
    Irreducible polynomials over GF(2) with prescribed coefficients. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:274, n:1-3, pp:265-279 [Journal]
  17. Ashok K. Agarwal, Gary L. Mullen
    Partitions with "d(a) copies of a". [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:48, n:1, pp:120-135 [Journal]
  18. Charles Laywine, Gary L. Mullen
    Generalizations of Bose's Equivalence between Complete Sets of Mutually Orthogonal Latin Squares and Affine Planes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:1, pp:13-35 [Journal]
  19. Gary L. Mullen, Wolfgang Ch. Schmid
    An Equivalence between (T, M, S)-Nets and Strongly Orthogonal Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:76, n:1, pp:164-174 [Journal]
  20. Kie H. Ham, Gary L. Mullen
    Distribution of irreducible polynomials of small degrees over finite fields. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1998, v:67, n:221, pp:337-341 [Journal]
  21. Jenny X. Li, Gary L. Mullen
    Parallel computing of a quasi-Monte Carlo algorithm for valuing derivatives. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2000, v:26, n:5, pp:641-653 [Journal]
  22. József Dénes, Gary L. Mullen, Stephan J. Suchower
    Another generalized Golomb-Posner code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:408-0 [Journal]
  23. Mulan Liu, Peizhong Lu, Gary L. Mullen
    Correlation-Immune Functions over Finite Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1273-1276 [Journal]
  24. Gary L. Mullen
    Permutation polynomials and nonsingular feedback shift registers over finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:900-0 [Journal]
  25. Gary L. Mullen, Robert E. Weber
    Latin cubes of order >=5. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:32, n:3, pp:291-297 [Journal]
  26. Gary L. Mullen
    Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:79-84 [Journal]
  27. Larry J. Brant, Gary L. Mullen
    A study of frequency cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:2, pp:115-121 [Journal]
  28. József Dénes, Gary L. Mullen
    Enumeration formulas for latin and frequency squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:157-163 [Journal]

Search in 0.002secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002