George Havas
- Artificial Intelligence top 5%
- Discrete Mathematics and Combinatorics top 2%
- Computational Theory and Mathematics top 5%
- Geometry and Topology top 5%
- Electrical and Electronic Engineering
- Co-authors
- Bohdan S. MajewskiZbigniew J. CzechMichael Vaughan-LeeXin FangJohn J. CannonM. F. NewmanJane WatsonColin M. Ramsay
- Topics
- Finite Group Theory Research (30 papers)Coding theory and cryptography (21 papers)graph theory and CDMA systems (18 papers)
- Journals
- SHILAP Revista de lepidopterologíaMathematics of ComputationTheoretical Computer Science
- Partner nations
- AustraliaUnited KingdomUnited States
In The Last Decade
George Havas
58 papers receiving 527 citations
Peers
Comparison fields: 5 of 61
- Artificial Intelligence 283
- Discrete Mathematics and Combinatorics 250
- Computational Theory and Mathematics 181
- Geometry and Topology 153
- Electrical and Electronic Engineering 148
Countries citing papers authored by George Havas
This map shows the geographic impact of George Havas'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 George Havas with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites George Havas more than expected).
Fields of papers citing papers by George Havas
This network shows the impact of papers produced by George Havas. 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 George Havas. The network helps show where George Havas may publish in the future.
Co-authorship network of co-authors of George Havas
This figure shows the co-authorship network connecting the top 25 collaborators of George Havas. A scholar is included among the top collaborators of George Havas 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 George Havas. George Havas is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | ALL SIMPLE GROUPS WITH ORDER FROM 1 MILLION TO 5 MILLION ARE EFFICIENT | 2 |
| 2 | 3 | |
| 3 | Defining Set Spectra for Designs can have Arbitrarily Large Gaps | 5 |
| 4 | 1 | |
| 5 | 1 | |
| 6 | 10 | |
| 7 | 3 | |
| 8 | The complexity of the extended GCD problem | 0 |
| 9 | GCD of many integers | 6 |
| 10 | 15 | |
| 11 | 23 | |
| 12 | Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. | 1 |
| 13 | 20 | |
| 14 | 78 | |
| 15 | An Efficient Method for Constructing a Distributed Depth-First Search Tree. | 1 |
| 16 | A hard problem that is almost always easy | 3 |
| 17 | 7 | |
| 18 | 19 | |
| 19 | 27 | |
| 20 | 6 |
About George Havas
George Havas is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 62 papers that have together received 610 indexed citations. Recurring topics across this work include Finite Group Theory Research (30 papers), Coding theory and cryptography (21 papers) and graph theory and CDMA systems (18 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (250 citations), Geometry and Topology (153 citations) and Algebra and Number Theory (58 citations). George Havas has collaborated with scholars based in Australia, United Kingdom and United States. Frequent co-authors include Bohdan S. Majewski, Zbigniew J. Czech, Michael Vaughan-Lee, Xin Fang, John J. Cannon, M. F. Newman, Jane Watson, Colin M. Ramsay, Derek F. Holt and S.B. Dewan. Their work appears in journals such as SHILAP Revista de lepidopterología, Mathematics of Computation and Theoretical Computer Science.
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.