George Havas
About
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
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | ALL SIMPLE GROUPS WITH ORDER FROM 1 MILLION TO 5 MILLION ARE EFFICIENT | SHILAP Revista de lepidopterología | C. M. Campbell, George Havas et al. | 2 |
| 2 | On Coxeter's families of group presentations | Journal of Algebra | George Havas, Derek F. Holt | 3 |
| 3 | Defining Set Spectra for Designs can have Arbitrarily Large Gaps | Queensland's institutional digital repository (The University of Queensland) | George Havas, Colin M. Ramsay et al. | 5 |
| 4 | The | Journal of Algebra | George Havas, Edmund F. Robertson et al. | 1 |
| 5 | Experimenting with Infinite Groups, I: Tables | Experimental Dermatology | Gilbert Baumslag, Sean Cleary et al. | 1 |
| 6 | Nice Efficient Presentions for all Small Simple Groups and their Covers | LMS Journal of Computation and Mathematics | C. M. Campbell, George Havas et al. | 10 |
| 7 | CERTAIN CYCLICALLY PRESENTED GROUPS ARE INFINITE | Communications in Algebra | George Havas, Derek F. Holt et al. | 3 |
| 8 | The complexity of the extended GCD problem | Lecture notes in computer science | George Havas, Jean‐Pierre Seifert | 0 |
| 9 | GCD of many integers | Gene Cooperman, Joachim von zur Gathen et al. | 6 | |
| 10 | On the Automorphism Groups of Quasiprimitive Almost Simple Graphs | Journal of Algebra | Xin Fang, George Havas et al. | 15 |
| 11 | Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction | Experimental Mathematics | George Havas, Bohdan S. Majewski et al. | 23 |
| 12 | Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. | Weifa Liang, George Havas | 1 | |
| 13 | Integer Matrix Diagonalization | Journal of Symbolic Computation | George Havas, Bohdan S. Majewski | 20 |
| 14 | Perfect hashing | Theoretical Computer Science | Zbigniew J. Czech, George Havas et al. | 78 |
| 15 | An Efficient Method for Constructing a Distributed Depth-First Search Tree. | Parallel and Distributed Processing Techniques and Applications | George Havas et al. | 1 |
| 16 | A hard problem that is almost always easy | Lecture notes in computer science | George Havas, Bohdan S. Majewski | 3 |
| 17 | A solution to the extended gcd problem | Bohdan S. Majewski, George Havas | 7 | |
| 18 | Recognizing badly presented Z-modules | Linear Algebra and its Applications | George Havas, Derek F. Holt et al. | 19 |
| 19 | A nilpotent quotient algorithm for graded Lie rings | Journal of Symbolic Computation | George Havas, M. F. Newman et al. | 27 |
| 20 | Implementation and Analysis of the Todd-Coxeter Algorithm | Mathematics of Computation | John J. Cannon, George Havas et al. | 6 |
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.