default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGary L. Mullen
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j49]Xiang-dong Hou
, Gary L. Mullen, Peter Shiue, Daqing Wan, Qiang Wang:
In Memory of Professor Zhexian Wan. Finite Fields Their Appl. 92: 102297 (2023)
2010 – 2019
- 2019
- [j48]Gove Effinger, Gary L. Mullen:
Two extended Euler functions with applications to latin squares and bases of finite field extensions. Bull. ICA 85: 92-111 (2019) - [j47]John T. Ethier, Gary L. Mullen:
Sets of mutually orthogonal Sudoku frequency squares. Des. Codes Cryptogr. 87(1): 57-65 (2019) - 2017
- [j46]Melissa A. Huggan, Gary L. Mullen, Brett Stevens, David Thomson:
Sudoku-like arrays, codes and orthogonality. Des. Codes Cryptogr. 82(3): 675-693 (2017) - [j45]James A. Davis, Sophie Huczynska, Gary L. Mullen:
Near-complete external difference families. Des. Codes Cryptogr. 84(3): 415-424 (2017) - 2016
- [j44]Lucia Moura, Gary L. Mullen, Daniel Panario:
Finite field constructions of combinatorial arrays. Des. Codes Cryptogr. 78(1): 197-219 (2016) - [j43]Gary L. Mullen, Daniel Panario, David Thomson:
Fast and Simple Modular Interpolation Using Factorial Representation. Am. Math. Mon. 123(5): 471-480 (2016) - 2015
- [j42]Gary L. Mullen:
A second decade of "Finite Fields and Their Applications". Finite Fields Their Appl. 32: 1-4 (2015) - [i1]Gary L. Mullen, Amela Muratovic-Ribic, Qiang Wang:
On coefficients of powers of polynomials and their compositions over finite fields. CoRR abs/1503.07487 (2015) - 2014
- [p7]Gary L. Mullen, Daqing Wan, Qiang Wang:
Index bounds for value sets of polynomials over finite fields. Applied Algebra and Number Theory 2014: 280-296 - 2013
- [j41]Sophie Huczynska, Gary L. Mullen, Daniel Panario, David Thomson:
Existence and properties of k-normal elements over finite fields. Finite Fields Their Appl. 24: 170-183 (2013) - [p6]Gary L. Mullen, Daniel Panario:
Introduction to finite fields : Basic properties of finite fields. Handbook of Finite Fields 2013: 13-31 - [p5]Gary L. Mullen, Daniel Panario:
Introduction to primitive polynomials. Handbook of Finite Fields 2013: 87-89 - [p4]Gary L. Mullen, Qiang Wang:
One variable. Handbook of Finite Fields 2013: 215-229 - [p3]Rudolf Lidl, Gary L. Mullen:
Several variables. Handbook of Finite Fields 2013: 230-231 - [p2]Gary L. Mullen, Michael E. Zieve:
Value sets of polynomials. Handbook of Finite Fields 2013: 232-235 - [p1]Gary L. Mullen:
Latin squares. Handbook of Finite Fields 2013: 550-555 - [e2]Gary L. Mullen, Daniel Panario:
Handbook of Finite Fields. Discrete mathematics and its applications, CRC Press 2013, ISBN 978-1-439-87378-6 [contents] - 2012
- [j40]John T. Ethier, Gary L. Mullen:
Strong forms of orthogonality for sets of hypercubes. Discret. Math. 312(12-13): 2050-2061 (2012) - [j39]John T. Ethier, Gary L. Mullen, Daniel Panario, Brett Stevens, David Thomson:
Sets of orthogonal hypercubes of class r. J. Comb. Theory A 119(2): 430-439 (2012) - [j38]Kenneth Hicks, Xiang-dong Hou, Gary L. Mullen:
Sums of Reciprocals of Polynomials over Finite Fields. Am. Math. Mon. 119(4): 313-317 (2012)
2000 – 2009
- 2009
- [j37]Xiang-dong Hou, Gary L. Mullen:
Number of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields. Finite Fields Their Appl. 15(3): 304-331 (2009) - [j36]Xiang-dong Hou, Gary L. Mullen, James A. Sellers, Joseph L. Yucas:
Reversed Dickson polynomials over finite fields. Finite Fields Their Appl. 15(6): 748-773 (2009) - [j35]Sophie Huczynska, Gary L. Mullen, Joseph L. Yucas:
The extent to which subsets are additively closed. J. Comb. Theory A 116(4): 831-843 (2009) - 2008
- [j34]Kenneth Hicks, Gary L. Mullen, Joseph L. Yucas, Ryan Zavislak:
A Polynomial Analogue of the 3n + 1 Problem. Am. Math. Mon. 115(7): 615-622 (2008) - 2007
- [b1]Gary L. Mullen, Carl Mummert:
Finite Fields and Applications. Student mathematical library 41, American Mathematical Society 2007, ISBN 978-0-8218-4418-2, pp. I-IX, 1-175 - 2005
- [j33]G. B. Belyavskaya, V. I. Izbash, Gary L. Mullen:
Check Character Systems using Quasigroups: I. Des. Codes Cryptogr. 37(2): 215-227 (2005) - [j32]G. B. Belyavskaya, V. I. Izbash, Gary L. Mullen:
Check Character Systems Using Quasigroups: II. Des. Codes Cryptogr. 37(3): 405-419 (2005) - [j31]Gary L. Mullen:
A decade of Finite Fields and Their Applications. Finite Fields Their Appl. 11(3): 321-325 (2005) - [j30]Zhibo Chen, Gary L. Mullen:
Transpositions and Representability. Am. Math. Mon. 112(10): 913-919 (2005) - 2004
- [j29]James A. Sellers, Andrew V. Sills, Gary L. Mullen:
Bijections and Congruences for Generalizations of Partition Identities of Euler and Guy. Electron. J. Comb. 11(1) (2004) - [j28]Joseph L. Yucas, Gary L. Mullen:
Self-Reciprocal Irreducible Polynomials Over Finite Fields. Des. Codes Cryptogr. 33(3): 275-281 (2004) - [j27]Joseph L. Yucas, Gary L. Mullen:
Irreducible polynomials over GF(2) with prescribed coefficients. Discret. Math. 274(1-3): 265-279 (2004) - [j26]A. Donald Keedwell, Gary L. Mullen:
Sets of partially orthogonal latin squares and projective planes. Discret. Math. 288(1-3): 49-60 (2004) - [e1]Gary L. Mullen, Alain Poli, Henning Stichtenoth:
Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers. Lecture Notes in Computer Science 2948, Springer 2004, ISBN 3-540-21324-4 [contents] - 2002
- [j25]Charles Laywine, Gary L. Mullen:
A hierarchy of complete orthogonal structures. Ars Comb. 63 (2002) - [j24]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. Computing 68(2): 97-109 (2002) - [j23]Bo Cheng, Gary L. Mullen:
Constructions for mutually orthogonal frequency hyperrectangles with a prescribed type. Discret. Math. 242(1-3): 55-64 (2002) - 2001
- [j22]Charles Laywine, Gary L. Mullen:
A Table of Lower Bounds for the Number of Mutually Orthogonal Frequency Squares. Ars Comb. 59 (2001) - 2000
- [j21]Jenny X. Li, Gary L. Mullen:
Parallel computing of a quasi-Monte Carlo algorithm for valuing derivatives. Parallel Comput. 26(5): 641-653 (2000)
1990 – 1999
- 1999
- [j20]James Arthur MacDougall, Gary L. Mullen:
A note on BIB designs with nested rows and columns. Australas. J Comb. 20: 257-260 (1999) - 1998
- [j19]Arnold Knopfmacher, J. N. Ridley, Gary L. Mullen:
Nets and Sequences Obtained from Irreducible Polynomials Over Finite Fields. Appl. Algebra Eng. Commun. Comput. 9(3): 265-269 (1998) - [j18]Kie H. Ham, Gary L. Mullen:
Distribution of irreducible polynomials of small degrees over finite fields. Math. Comput. 67(221): 337-341 (1998) - [j17]Mulan Liu, Peizhong Lu, Gary L. Mullen:
Correlation-Immune Functions over Finite Fields. IEEE Trans. Inf. Theory 44(3): 1273-1276 (1998) - 1997
- [j16]Andrew T. Clayman, Gary L. Mullen:
Improved (T, M, S)-net Parameters from the Gilbert-Varshamov Bound. Appl. Algebra Eng. Commun. Comput. 8(6): 491-496 (1997) - [j15]Mulan Liu, Gary L. Mullen:
Irreducible Polynomials and Linear Recurring Arrays. Discret. Appl. Math. 74(1): 93-99 (1997) - 1996
- [j14]Ilene H. Morgan, Gary L. Mullen, Miodrag V. Zivkovic:
Almost weakly self-dual bases for finite fields. Appl. Algebra Eng. Commun. Comput. 8(1): 25-31 (1996) - [j13]Gary L. Mullen, Wolfgang Ch. Schmid:
An Equivalence between (T, M, S)-Nets and Strongly Orthogonal Hypercubes. J. Comb. Theory A 76(1): 164-174 (1996) - 1993
- [j12]József Dénes, Gary L. Mullen:
Enumeration formulas for latin and frequency squares. Discret. Math. 111(1-3): 157-163 (1993) - 1992
- [j11]G. Meletiou, Gary L. Mullen:
A Note on Discrete Logarithms in Finite Fields. Appl. Algebra Eng. Commun. Comput. 3: 75-78 (1992) - [j10]Charles Laywine, Gary L. Mullen:
Generalizations of Bose's Equivalence between Complete Sets of Mutually Orthogonal Latin Squares and Affine Planes. J. Comb. Theory A 61(1): 13-35 (1992) - 1991
- [j9]Stephen D. Cohen, Gary L. Mullen:
Primitive Elements in Finite Fields and Costas Arrays. Appl. Algebra Eng. Commun. Comput. 2: 45-53 (1991) - [j8]Stephen D. Cohen, Gary L. Mullen:
Primitive Elements in Finite Fields and Costas Arrays. Appl. Algebra Eng. Commun. Comput. 2: 297-299 (1991) - 1990
- [j7]József Dénes, Gary L. Mullen, Stephan J. Suchower:
Another generalized Golomb-Posner code. IEEE Trans. Inf. Theory 36(2): 408-411 (1990)
1980 – 1989
- 1989
- [j6]Gary L. Mullen:
Permutation polynomials and nonsingular feedback shift registers over finite fields. IEEE Trans. Inf. Theory 35(4): 900-902 (1989) - 1988
- [j5]Gary L. Mullen:
Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order. Discret. Math. 69(1): 79-84 (1988) - [j4]Larry J. Brant, Gary L. Mullen:
A study of frequency cubes. Discret. Math. 69(2): 115-121 (1988) - [j3]Ashok Kumar Agarwal, Gary L. Mullen:
Partitions with "d(a) copies of a". J. Comb. Theory A 48(1): 120-135 (1988) - 1987
- [j2]Gary L. Mullen, Harald Niederreiter:
Optimal characteristic polynomials for digital multistep pseudorandom numbers. Computing 39(2): 155-163 (1987) - 1980
- [j1]Gary L. Mullen, Robert E. Weber:
Latin cubes of order >=5. Discret. Math. 32(3): 291-297 (1980)
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-07-08 21:26 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:
