Ronald C. Mullin
- Artificial Intelligence top 5%
- Information Systems top 5%
- Electrical and Electronic Engineering
- Computational Theory and Mathematics top 5%
- Discrete Mathematics and Combinatorics top 5%
- Co-authors
- Ian F. BlakeScott A. VanstoneXuhong GaoTomik YaghoobianR. G. StantonCharles J. ColbournAlan C. H. LingF.E. Bennett
- Topics
- graph theory and CDMA systems (10 papers)Coding theory and cryptography (7 papers)Finite Group Theory Research (5 papers)
- Partner nations
- CanadaUnited StatesGermany
In The Last Decade
Ronald C. Mullin
22 papers receiving 386 citations
Peers
Comparison fields: 5 of 37
- Artificial Intelligence 341
- Information Systems 207
- Electrical and Electronic Engineering 135
- Computational Theory and Mathematics 107
- Discrete Mathematics and Combinatorics 87
Countries citing papers authored by Ronald C. Mullin
This map shows the geographic impact of Ronald C. Mullin'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 Ronald C. Mullin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ronald C. Mullin more than expected).
Fields of papers citing papers by Ronald C. Mullin
This network shows the impact of papers produced by Ronald C. Mullin. 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 Ronald C. Mullin. The network helps show where Ronald C. Mullin may publish in the future.
Co-authorship network of co-authors of Ronald C. Mullin
This figure shows the co-authorship network connecting the top 25 collaborators of Ronald C. Mullin. A scholar is included among the top collaborators of Ronald C. Mullin 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 Ronald C. Mullin. Ronald C. Mullin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | A generalized counting and factoring method for polynomials over finite fields | 6 |
| 3 | 1 | |
| 4 | 9 | |
| 5 | 5 | |
| 6 | 10 | |
| 7 | 19 | |
| 8 | 11 | |
| 9 | 3 | |
| 10 | 27 | |
| 11 | The closure of all subsets of {3, 4, ...10} which include 3. | 7 |
| 12 | 2 | |
| 13 | 9 | |
| 14 | 232 | |
| 15 | 3 | |
| 16 | 28 | |
| 17 | Proceedings of the second Louisiana Conference on Combinatorics, Graph Theory and Computing, Louisiana State University, Baton Rouge, March 8-11, 1971 | 4 |
| 18 | On the foundations of combinatorial theory III | 9 |
| 19 | 28 | |
| 20 | An Enumerative Survey of Triangular Maps. | 1 |
About Ronald C. Mullin
Ronald C. Mullin is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Algebra and Number Theory, having authored 22 papers that have together received 457 indexed citations. Recurring topics across this work include graph theory and CDMA systems (10 papers), Coding theory and cryptography (7 papers) and Finite Group Theory Research (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (87 citations), Artificial Intelligence (341 citations) and Information Systems (207 citations). Ronald C. Mullin has collaborated with scholars based in Canada, United States and Germany. Frequent co-authors include Ian F. Blake, Scott A. Vanstone, Xuhong Gao, Tomik Yaghoobian, R. G. Stanton, Charles J. Colbourn, Alan C. H. Ling, F.E. Bennett, Gian‐Carlo Rota and Gary L. Mullen. Their work appears in journals such as Pacific Journal of Mathematics, Linear Algebra and its Applications and Discrete Mathematics.
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.