George Havas

1.5k total citations
62 papers, 610 citations indexed

About

George Havas is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, George Havas has authored 62 papers receiving a total of 610 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Discrete Mathematics and Combinatorics, 28 papers in Computational Theory and Mathematics and 25 papers in Artificial Intelligence. Recurrent topics in George Havas's work include Finite Group Theory Research (30 papers), Coding theory and cryptography (21 papers) and graph theory and CDMA systems (18 papers). George Havas is often cited by papers focused on Finite Group Theory Research (30 papers), Coding theory and cryptography (21 papers) and graph theory and CDMA systems (18 papers). George Havas collaborates with scholars based in Australia, United Kingdom and United States. George Havas's 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 and has published in prestigious journals such as SHILAP Revista de lepidopterología, Mathematics of Computation and Theoretical Computer Science.

In The Last Decade

George Havas

58 papers receiving 527 citations

Peers

George Havas
Gyula O. H. Katona Hungary
Clement Lam Canada
Aiden A. Bruen Canada
Hadi Kharaghani Canada
N. Sauer Canada
Shachar Lovett United States
Danièle Gardy France
Andrew Klapper United States
Terry A. McKee United States
Michael Anshel United States
Gyula O. H. Katona Hungary
George Havas
Citations per year, relative to George Havas George Havas (= 1×) peers Gyula O. H. Katona

Countries citing papers authored by George Havas

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Campbell, C. M., et al.. (2013). ALL SIMPLE GROUPS WITH ORDER FROM 1 MILLION TO 5 MILLION ARE EFFICIENT. SHILAP Revista de lepidopterología. 2 indexed citations
2.
Havas, George & Derek F. Holt. (2010). On Coxeter's families of group presentations. Journal of Algebra. 324(5). 1076–1082. 3 indexed citations
3.
Havas, George, et al.. (2008). Defining Set Spectra for Designs can have Arbitrarily Large Gaps. Queensland's institutional digital repository (The University of Queensland). 75. 67–81. 5 indexed citations
4.
Havas, George, et al.. (2006). The Fa,b,c conjecture is true, II. Journal of Algebra. 300(1). 57–72. 1 indexed citations
5.
Baumslag, Gilbert, Sean Cleary, & George Havas. (2004). Experimenting with Infinite Groups, I: Tables. Experimental Dermatology. 8(4). 334–6. 1 indexed citations
6.
Campbell, C. M., George Havas, Colin M. Ramsay, & Edmund F. Robertson. (2004). Nice Efficient Presentions for all Small Simple Groups and their Covers. LMS Journal of Computation and Mathematics. 7. 266–283. 10 indexed citations
7.
Havas, George, Derek F. Holt, & Michael E. Newman. (2001). CERTAIN CYCLICALLY PRESENTED GROUPS ARE INFINITE. Communications in Algebra. 29(11). 5175–5178. 3 indexed citations
8.
Havas, George & Jean‐Pierre Seifert. (1999). The complexity of the extended GCD problem. Lecture notes in computer science. 1672. 103–113.
9.
Cooperman, Gene, et al.. (1999). GCD of many integers. 1627. 310–317. 6 indexed citations
10.
Fang, Xin, George Havas, & Cheryl E. Praeger. (1999). On the Automorphism Groups of Quasiprimitive Almost Simple Graphs. Journal of Algebra. 222(1). 271–283. 15 indexed citations
11.
Havas, George, et al.. (1998). Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction. Experimental Mathematics. 7(2). 125–136. 23 indexed citations
12.
Liang, Weifa & George Havas. (1998). Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3.. 37–50. 1 indexed citations
13.
Havas, George & Bohdan S. Majewski. (1997). Integer Matrix Diagonalization. Journal of Symbolic Computation. 24(3-4). 399–408. 20 indexed citations
14.
Czech, Zbigniew J., George Havas, & Bohdan S. Majewski. (1997). Perfect hashing. Theoretical Computer Science. 182(1-2). 1–143. 78 indexed citations
15.
Havas, George, et al.. (1997). An Efficient Method for Constructing a Distributed Depth-First Search Tree.. Parallel and Distributed Processing Techniques and Applications. 660–666. 1 indexed citations
16.
Havas, George & Bohdan S. Majewski. (1995). A hard problem that is almost always easy. Lecture notes in computer science. 1004. 216–223. 3 indexed citations
17.
Majewski, Bohdan S. & George Havas. (1995). A solution to the extended gcd problem. 248–253. 7 indexed citations
18.
Havas, George, Derek F. Holt, & Sarah Rees. (1993). Recognizing badly presented Z-modules. Linear Algebra and its Applications. 192. 137–163. 19 indexed citations
19.
Havas, George, M. F. Newman, & Michael Vaughan-Lee. (1990). A nilpotent quotient algorithm for graded Lie rings. Journal of Symbolic Computation. 9(5-6). 653–664. 27 indexed citations
20.
Cannon, John J., et al.. (1973). Implementation and Analysis of the Todd-Coxeter Algorithm. Mathematics of Computation. 27(123). 463–463. 6 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Gyula O. H. Katona Breakdown of academic impact, for papers by Clement Lam Breakdown of academic impact, for papers by Aiden A. Bruen Breakdown of academic impact, for papers by Hadi Kharaghani Breakdown of academic impact, for papers by N. Sauer Breakdown of academic impact, for papers by Shachar Lovett Breakdown of academic impact, for papers by Danièle Gardy Breakdown of academic impact, for papers by Andrew Klapper Breakdown of academic impact, for papers by Terry A. McKee Breakdown of academic impact, for papers by Michael Anshel
Rankless by CCL
2026