Gary L. Mullen
About
In The Last Decade
Gary L. Mullen
125 papers receiving 1.4k citations
Peers
Comparison fields: 5 of 74
- Artificial Intelligence 987
- Electrical and Electronic Engineering 626
- Computational Theory and Mathematics 393
- Discrete Mathematics and Combinatorics 310
- Information Systems 248
Countries citing papers authored by Gary L. Mullen
This map shows the geographic impact of Gary L. Mullen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Gary L. Mullen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gary L. Mullen more than expected).
Fields of papers citing papers by Gary L. Mullen
This network shows the impact of papers produced by Gary L. Mullen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Gary L. Mullen. The network helps show where Gary L. Mullen may publish in the future.
Co-authorship network of co-authors of Gary L. Mullen
This figure shows the co-authorship network connecting the top 25 collaborators of Gary L. Mullen. A scholar is included among the top collaborators of Gary L. Mullen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Gary L. Mullen. Gary L. Mullen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Strong forms of orthogonality for sets of frequency hypercubes | 1 |
| 2 | Finite Fields with Applications to Coding Theory, Cryptography and Related Areas: Proceedings of the Sixth International Conference on Finite Fields ... held at Oaxaca, Mxico, May 21-25, 2001 | 0 |
| 3 | 45 | |
| 4 | Finite Fields and Applications: 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003: Revised Papers (LECTURE NOTES IN COMPUTER SCIENCE) | 0 |
| 5 | n-T-quasigroup codes with one check symbol and their error detection capabilities | 8 |
| 6 | A hierarchy of complete orthogonal structures | 2 |
| 7 | A table of lower bounds for the number of mutually orthogonal frequency squares | 4 |
| 8 | A Quasigroup-Based Public-Key Cryptosystem | 6 |
| 9 | Bases and the distribution of irreducible and primitive polynomials over finite fields | 1 |
| 10 | Completely normal primitive basis generators of finite fields | 3 |
| 11 | 3 | |
| 12 | 6 | |
| 13 | 15 | |
| 14 | 13 | |
| 15 | 5 | |
| 16 | 69 | |
| 17 | 12 | |
| 18 | Dickson Polynomials Over Finite Fields | 4 |
| 19 | 13 | |
| 20 | 2 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.