George Havas
-
- Finite Group Theory Research 30
- Geometry and Topology top 5%
- Geometric and Algebraic Topology 13
-
- semigroups and automata theory 8
- Advanced Graph Theory Research 8
- Complexity and Algorithms in Graphs 7
- Polynomial and algebraic computation 5
- Artificial Intelligence top 5%
- Coding theory and cryptography 21
-
- graph theory and CDMA systems 18
- Co-authors
- Bohdan S. MajewskiZbigniew J. CzechMichael Vaughan-LeeXin FangJohn J. CannonM. F. NewmanJane WatsonColin M. Ramsay
- Journals
- SHILAP Revista de lepidopterología (1 paper)Mathematics of Computation (2 papers)Theoretical Computer Science (1 paper)
- Partner nations
- AustraliaUnited KingdomUnited States
In The Last Decade
George Havas
58 papers receiving 527 citations
Peers
Comparison fields: 5 of 61
- Discrete Mathematics and Combinatorics 250
- Geometry and Topology 153
- Algebra and Number Theory 58
- Computational Theory and Mathematics 181
- Artificial Intelligence 283
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
The 25 scholars most cited alongside George Havas, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | ALL SIMPLE GROUPS WITH ORDER FROM 1 MILLION TO 5 MILLION ARE EFFICIENT | 2013 | 2 |
| 2 | 2010 | 3 | |
| 3 | Defining Set Spectra for Designs can have Arbitrarily Large Gaps | 2008 | 5 |
| 4 | 2006 | 1 | |
| 5 | 2004 | 1 | |
| 6 | 2004 | 10 | |
| 7 | 2001 | 3 | |
| 8 | The complexity of the extended GCD problem | 1999 | 0 |
| 9 | GCD of many integers | 1999 | 6 |
| 10 | 1999 | 15 | |
| 11 | 1998 | 23 | |
| 12 | Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. | 1998 | 1 |
| 13 | 1997 | 20 | |
| 14 | 1997 | 78 | |
| 15 | An Efficient Method for Constructing a Distributed Depth-First Search Tree. | 1997 | 1 |
| 16 | A hard problem that is almost always easy | 1995 | 3 |
| 17 | 1995 | 7 | |
| 18 | 1993 | 19 | |
| 19 | 1990 | 27 | |
| 20 | 1973 | 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), graph theory and CDMA systems (18 papers), Geometric and Algebraic Topology (13 papers), semigroups and automata theory (8 papers), Advanced Graph Theory Research (8 papers), Complexity and Algorithms in Graphs (7 papers) and Polynomial and algebraic computation (5 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.