F.E. Bennett
Impact in
-
- Finite Group Theory Research
- Artificial Intelligence top 5%
- Coding theory and cryptography
Papers in
-
- graph theory and CDMA systems 74
-
- Coding theory and cryptography 38
- Co-authors
- R. Julian R. Abel (23 shared papers)Jian-Hua Yin (7 shared papers)Gennian Ge (4 shared papers)John Slaney (1 shared paper)Masayuki Fujita (1 shared paper)Charles J. Colbourn (2 shared papers)G. Ge (5 shared papers)Lei Zhu (3 shared papers)
In The Last Decade
F.E. Bennett
69 papers receiving 512 citations
Peers
Comparison fields: 5 of 31
- Discrete Mathematics and Combinatorics 239
- Artificial Intelligence 387
- Electrical and Electronic Engineering 522
- Computational Theory and Mathematics 138
- Geometry and Topology 49
Countries citing papers authored by F.E. Bennett
This map shows the geographic impact of F.E. Bennett'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 F.E. Bennett with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites F.E. Bennett more than expected).
Fields of papers citing papers by F.E. Bennett
This network shows the impact of papers produced by F.E. Bennett. 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 F.E. Bennett. The network helps show where F.E. Bennett may publish in the future.
Co-authors
The 20 scholars most cited alongside F.E. Bennett, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 76 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Automatic generation of some results in finite algebra | 1993 | 42 |
| 2 | 2007 | 26 | |
| 3 | 1980 | 23 | |
| 4 | 2000 | 23 | |
| 5 | 2007 | 21 | |
| 6 | 1992 | 21 | |
| 7 | 1998 | 19 | |
| 8 | 1990 | 17 | |
| 9 | 1981 | 15 | |
| 10 | 2003 | 15 | |
| 11 | 1999 | 14 | |
| 12 | 1998 | 14 | |
| 13 | 1996 | 14 | |
| 14 | 1996 | 13 | |
| 15 | 1997 | 11 | |
| 16 | 2004 | 11 | |
| 17 | 2002 | 11 | |
| 18 | 1990 | 11 | |
| 19 | 1997 | 11 | |
| 20 | Further results on the existence of HSOLSSOM(h n ). | 1996 | 10 |
About F.E. Bennett
F.E. Bennett is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence, Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 76 papers that have together received 567 indexed citations. Recurring topics across this work include graph theory and CDMA systems (74 papers), Coding theory and cryptography (38 papers), Finite Group Theory Research (29 papers), Graph Labeling and Dimension Problems (12 papers), Mathematics and Applications (9 papers), Genomic variations and chromosomal abnormalities (3 papers), semigroups and automata theory (3 papers) and Optimal Experimental Design Methods (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (239 citations), Artificial Intelligence (387 citations), Electrical and Electronic Engineering (522 citations), Computational Theory and Mathematics (138 citations) and Geometry and Topology (49 citations). F.E. Bennett has collaborated with scholars based in Canada, China and Australia. Frequent co-authors include R. Julian R. Abel, Jian-Hua Yin, Gennian Ge, John Slaney, Masayuki Fujita, Charles J. Colbourn, G. Ge, Lei Zhu, Hantao Zhang and Ronald C. Mullin. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Designs, Discrete Applied Mathematics, Journal of Combinatorial Theory Series A and Journal of Statistical Planning and Inference.
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.