Software

  1. Coset enumeration: ACE version 3.001 (29 Mar 01, limited to at most about 2×109 cosets)
    Colin Ramsay's source code + some test scripts [gzipped tar file, 106KB]
    Colin Ramsay's 2001 version of a draft manual for ACE 3.001 265K pdf
    This version of ACE is accessible via both the Magma Computational Algebra System and GAP - Groups, Algorithms, Programming - a System for Computational Discrete Algebra.
  2. Coset enumeration: ACE version 4.1 (total cosets limited only by available memory)
    Colin Ramsay's source code + some test scripts [gzipped tar file, 384KB]
    Colin Ramsay's 2009 version of a draft manual for ACE 4 306K pdf
  3. Proof Extraction After Coset Enumeration: PEACE version 1
    Colin Ramsay's source code + some test scripts [gzipped tar file, 85K]
  4. Perfect hashing [gzipped tar file, 17K]

(P)reprints

This includes links to (p)reprint versions in pdf of some published and submitted papers.
  1. Lattices with sublattices of a given order
    George Havas and Martin Ward
    J. Combinatorial Theory 7 (1969) 281-282. [ Open Access]
  2. Implementation and analysis of the Todd-Coxeter algorithm
    John J. Cannon, Lucien A. Dimino, George Havas and Jane M. Watson
    Math. Comp. 27 (1973) 463-490 [ Free Access]
  3. A Reidemeister-Schreier program
    Proceedings of the Second International Conference on the Theory of Groups, Lecture Notes in Math. 372 (1974) 347-356. [Reprint: 478K]
  4. The two generator restricted Burnside group of exponent five
    George Havas, G.E. Wall and J.W. Wamsley
    Bull. Austral. Math. Soc. 10 (1974), 459-470. [ Free Access]
  5. Defining relations for the Held-Higman-Thompson simple group
    John J. Cannon and George Havas
    Bull. Austral. Math. Soc. 11 (1974) 43-46. [ Free Access]
  6. Computational approaches to combinatorial group theory
    PhD Thesis, The University of Sydney (1974) 237 pages. [Scanned: 7MB]
    Abstract: Bull. Austral. Math. Soc. 11 (1974) 475-476. [ Free Access]
  7. Computer aided determination of a Fibonacci group
    Bull. Austral. Math. Soc. 15 (1976) 297-305. [ Free Access]
  8. Some complexity problems in algebraic computations
    Proceedings The Complexity of Computational Problem Solving, University of Queensland Press (1976) 184-192. [Scanned: 203K]
  9. Collection
    George Havas and Tim Nicholson
    Proceedings SYMSAC '76, ACM Symposium on Symbolic and Algebraic Computation, ACM (1976) 9-14. [Reprint: 541K]
  10. A computer aided classification of certain groups of prime power order
    Judith A. Ascione, George Havas and C.R. Leedham-Green
    Bulletin of the Australian Mathematical Society 17 (1977) 257-274; Corrigendum: ibid. 317-319; Microfiche supplement: ibid. 320 [ Free Access | Corrigendum: Free Access | Corrections: 88K]
  11. Integer matrices and abelian groups
    George Havas and Leon S. Sterling
    Symbolic and algebraic computation, Lecture Notes in Computer Science 72 (1979) 431-451
    [Reprint: 1158K]
  12. The last of the Fibonacci groups
    George Havas, J.S. Richardson and Leon S. Sterling
    Proc. Roy. Soc. Edinburgh 83A (1979) 199-203. [Reprint: 232K]
  13. Groups of exponent eight
    Fritz J. Grunewald, George Havas, J.L. Mennicke and M.F. Newman
    Bull. Austral. Math. Soc. 20 (1979) 7-16. [ Free Access]
  14. Groups of exponent eight
    Fritz J. Grunewald, George Havas, J.L. Mennicke and M.F. Newman
    Burnside groups, Lecture Notes in Math. 806 (1980) 49-188. [Reprint: 3555K]
  15. Application of computers to questions like those of Burnside
    George Havas and M.F. Newman
    Burnside groups, Lecture Notes in Math. 806 (1980) 211-230. [Reprint: 838K]
  16. Commutators in groups expressed as products of powers
    Comm. Algebra 9 (1981) 115-129. [Reprint: 396K]
  17. HYPERdisk, an access method for remote disk devices
    Australian Computer Journal 13 (1981) 64-65. [Scanned: 91K]
  18. Groups in Durham
    CSIRONET News 167 (1982) 19-20, (Reprinted in Newsletter of the London Mathematical Society 96 (1983)). [Scanned: 722K]
  19. Minimal presentations for finite groups of prime-power order
    George Havas and M.F. Newman
    Comm. Algebra 11 (1983), no. 20, 2267-2275. [Reprint: 199K]
  20. Groups of exponent five and class four
    George Havas and J.S. Richardson
    Comm. Algebra 11 (1983) 287-304. [Reprint: 419K]
  21. Two groups which act on cubic graphs
    George Havas and Edmund F. Robertson
    Computational group theory, Academic Press (1984) 65-68. [Scanned: 218K]
  22. A Tietze transformation program
    George Havas, P.E. Kenne, J.S. Richardson and E.F. Robertson
    Computational group theory, Academic Press (1984) 69-73. [Scanned: 314K]
  23. Distinguishing eleven crossing knots
    George Havas and L.G. Kovacs
    Computational group theory, Academic Press (1984) 367-373. [Scanned: 276K]
  24. Local Computer Network Systems at CSIRO [In Japanese]
    G. Havas and Takeyoshi Tsukomoto
    FUJITSU 35 (1984) 107-115. [Scanned: 244K]
  25. A nilpotent quotient algorithm for graded Lie rings
    George Havas, M. F. Newman and M. R. Vaughan-Lee
    Journal of Symbolic Computation 9 (1990) 655-664. [Reprint: 835K]
  26. Coset enumeration strategies
    ISSAC'91 (Proc. 1991 International Symposium on Symbolic and Algebraic Computation), ACM Press (1991) 191-199. [Reprint: 1076K]
  27. An optimal algorithm for generating minimal perfect hash functions
    Zbigniew J. Czech, George Havas and Bohdan S. Majewski
    Information Processing Letters 43 (1992) 257-264. [Reprint: 125K]
  28. Algorithms for groups
    John Cannon and George Havas
    Australian Computer Journal 24 (1992) 51-60. [Reprint: 822K]
  29. Optimal algorithms for minimal perfect hashing
    George Havas and Bohdan S. Majewski
    Technical Report 234, The University of Queensland (1992). [Preprint: 199K]
  30. Application of substring searching methods to group presentations
    George Havas and Mark Ollila
    Australian Computer Science Communications 15 (1993) 587-593. [Preprint: 110K]
  31. Recognizing badly presented Z-modules
    George Havas, Derek F. Holt and Sarah Rees
    Linear Algebra and its Applications 192 (1993) 137-164. [Preprint: 181K | Reprint: 1612K]
  32. Graph theoretic obstacles to perfect hashing
    George Havas and Bohdan S. Majewski
    Congressus Numerantium 98 (1993) 81-93. [Preprint: 157K]
  33. Graphs, hypergraphs and hashing
    George Havas, Bohdan S. Majewski, Nicholas C. Wormald and Zbigniew J. Czech
    Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 790 (1994), 153-165. [Reprint: 865K]
  34. Application of computational tools for finitely presented groups
    George Havas and Edmund F. Robertson
    Computational Support for Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 15 (1994), 29-39. [Preprint: 129K]
  35. Hermite normal form computation for integer matrices
    George Havas and Bohdan S. Majewski
    Congressus Numerantium 105 (1994) 87-96. [Preprint: 124K]
  36. The complexity of greatest common divisor computations
    Bohdan S. Majewski and George Havas
    Algorithmic Number Theory, Lecture Notes in Computer Science 877 (1994) 184-193. [Reprint: 583K]
  37. A new problem in string searching
    George Havas and Jin Xian Lian
    Algorithms and Computation, Lecture Notes in Computer Science 834 (1994) 660-668. [Reprint: 571K]
  38. Reconstructing a distributed depth-first-search tree after network topology changes
    S.A.M. Makki and George Havas
    Proc. Sixth IASTED/ISMM Internat. Conf. Parallel and Distributed Computing and Systems, Acta Press (1994) 335-337. [Preprint: 65K]
  39. Extended gcd algorithms
    George Havas, B.S. Majewski and K.R. Matthews
    Technical Report 302, The University of Queensland (1995). [Preprint: 160K]
  40. Groups of deficiency zero
    George Havas, M.F. Newman and E.A. O'Brien
    Geometric and Computational Perspectives on Infinite Groups, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 25 (1996) 53-67. [Preprint: 145K]
  41. A solution to the extended gcd problem
    Bohdan S. Majewski and George Havas
    ISSAC'95 (Proc. 1995 Internat. Sympos. on Symbolic and Algebraic Computation), ACM Press (1995) 248-253. [Reprint: 587K]
  42. Extended gcd calculation
    George Havas and Bohdan S. Majewski
    Congressus Numerantium 111 (1995) 104-114. [Preprint: 112K]
  43. Central factors of deficiency zero groups
    George Havas and Edmund F. Robertson
    Communications in Algebra 24 (1996) 3483-3487. [Reprint: 179K]
  44. A hard problem that is almost always easy
    George Havas and B.S. Majewski
    Algorithms and Computation, Lecture Notes in Computer Science 1004 (1995) 216-223. [Reprint: 383K]
  45. A new algorithm and refined bounds for extended gcd computation
    David Ford and George Havas
    Algorithmic Number Theory, Lecture Notes in Computer Science 1122 (1996) 145-150. [Reprint: 234K]
  46. Empirical analysis of distributed depth-first search algorithms
    S.A.M. Makki and George Havas
    Proc. Eighth IASTED Internat. Conf. Parallel and Distributed Computing and Systems, Acta Press (1996) 292-296. [Preprint: 96K]
  47. A family of perfect hashing methods
    Bohdan S. Majewski, Nicholas C. Wormald, George Havas and Zbigniew J. Czech
    Computer Journal 39 (1996) 547-554. [Preprint: 176K | Reprint: 4896K]
  48. Distributed algorithms for depth-first search
    S.A.M. Makki and George Havas
    Information Processing Letters 60 (1996) 7-12. [Reprint: 353K]
  49. Integer matrix diagonalization
    George Havas and Bohdan S. Majewski
    Journal of Symbolic Computation 24 (1997) 399-408. [Reprint: 361K]
  50. Practical parallel coset enumeration
    Gene Cooperman and George Havas
    Workshop on High Performance Computing and Gigabit Local Area Networks, Lecture Notes in Control and Information Sciences 226 (1997) 15-27. [Reprint: 828K]
  51. Symmetric presentations and orthogonal groups
    C.M. Campbell, George Havas, S.A. Linton and E.F. Robertson
    The Atlas of Finite Groups: Ten Years On, London Mathematical Society Lecture Note Series 249, Cambridge University Press (1998) 1-10. [Reprint: 682K]
  52. Perfect Hashing
    Zbigniew J. Czech, George Havas and Bohdan S. Majewski
    Theoretical Computer Science 182 (1997) 1-143. [Reprint: 6283K]
  53. On the worst-case complexity of integer Gaussian elimination
    Xin Gui Fang and George Havas
    ISSAC'97 (Proc. 1997 Internat. Sympos. on Symbolic and Algebraic Computation), ACM Press (1997) 28-31. [Reprint: 545K]
  54. An efficient method for constructing a distributed depth-first search tree
    S.A.M. Makki and George Havas
    PDPTA'97 (Proc. Internat. Conf. Parallel and Distributed Processing Techniques and Applications), CSREA Press (1997) 660-666. [Preprint: 92K]
  55. NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph
    Weifa Liang and George Havas
    Euro-Par'97 Parallel Processing, Lecture Notes in Computer Science 1300 (1997) 430-439. [Reprint: 736K]
  56. Automorphism groups of certain non-quasiprimitive almost simple graphs
    Xin Gui Fang, George Havas and Jie Wang
    Groups St Andrews 1997 in Bath, Volume I, London Mathematical Society Lecture Note Series 260, Cambridge University Press (1999) 267-274. [Preprint: 123K | Reprint: 775K]
  57. Finding the k most vital edges with respect to minimum spanning trees for k = 2 and 3
    Weifa Liang and George Havas
    Computing Theory '98 (Proc. 4th Australasian Theory Symposium), Springer Verlag (1998) 37-50. [Preprint: 164K]
  58. Parallel approximate edge coloring revisited
    Weifa Liang, George Havas and Anne Street
    Proceedings of PART'97: The 4th Australasian Conference on Parallel and Real-Time Systems, Springer-Verlag (1998) 95-103. [Preprint: 135K]
  59. Extended gcd and Hermite normal form algorithms via lattice basis reduction
    George Havas, Bohdan S. Majewski and Keith R. Matthews
    Experimental Mathematics 7 (1998) 125-136 (Addenda and errata: Experimental Mathematics 8 (1999) 205). [Reprint: 266K | Addenda: 80K] | Corrections: KRM Feb 2017]
  60. On the automorphism groups of quasiprimitive almost simple graphs
    Xin Gui Fang, George Havas and Cheryl E. Praeger
    Journal of Algebra 222 (1999) 271-283. [Reprint: 114K]
  61. A family of non-quasiprimitive graphs admitting a quasiprimitive 2-arc transitive group action
    Xin Gui Fang, George Havas and Jie Wang
    European Journal of Combinatorics 20 (1999) 551-557. [Reprint: 121K]
  62. Counting trees
    George Havas, Dean G. Hoffman and Colin Ramsay
    Research on Combinatorial Algorithms (Proc. Eighth Australasian Workshop on Combinatorial Algorithms), Queensland University of Technology (1997) 1-10. [Preprint: 118K]
  63. Matrix reduction algorithms for Euclidean rings
    George Havas and Clemens Wagner
    Proc. 1998 Asian Symposium on Computer Mathematics, Lanzhou University Press (1998) 65-70. [Preprint: 118K]
  64. A presentation for the Lyons simple group
    George Havas and Charles C. Sims
    Computational Methods for Representations of Groups and Algebras, Progress in Mathematics 173 (1999) 241-249, Birkhaeuser. [Reprint: 837K]
  65. On Sims' presentation for Lyons' simple group
    Holger W. Gollan and George Havas
    Computational Methods for Representations of Groups and Algebras, Progress in Mathematics 173 (1999) 235-240, Birkhaeuser. [Reprint: 639K]
  66. Improved Lightpath (Wavelength) Routing in Large WDM Networks
    Weifa Liang, George Havas and Xiaojun Shen
    Proc. 18th International Conference on Distributed Computing Systems, IEEE Computer Society (1998) 516-523. [Reprint: 210K]
  67. Functional decomposition of a class of wild polynomials
    Robert Coulter, George Havas and Marie Henderson
    Journal of Combinatorial Mathematics and Combinatorial Computing 28 (1998) 87-94. [Preprint: 100K]
  68. Permutation Routing in All-Optical Networks
    Weifa Liang, George Havas and Xiaojun Shen
    Technical Report 436, Department of Computer Science and Electrical Engineering, The University of Queensland (1998). [Preprint: 210K]
  69. Groups with exponent six
    George Havas, M.F. Newman, Alice C. Niemeyer and Charles C. Sims
    Communications in Algebra 27 (1999) 3619-3638. [Reprint: 778K]
  70. Elementary Algebra Revisited: Randomized Algorithms
    Gene Cooperman and George Havas
    Randomization Methods in Algorithm Design, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1999) 37-44. [Preprint: 142K]
  71. The complexity of the extended GCD problem
    George Havas and Jean-Pierre Seifert
    Mathematical Foundations of Computer Science 1999, Lecture Notes in Computer Science 1672 (1999) 103-113. [Reprint: 574K]
  72. On routing in circulant graphs
    Jin-Yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert and Igor Shparlinski
    Computing and Combinatorics, Lecture Notes in Computer Science 1627 (1999) 360-369. [Reprint: 174K]
  73. GCD of many integers
    Gene Cooperman, Sandra Feisel, Joachim von zur Gathen and George Havas
    Computing and Combinatorics, Lecture Notes in Computer Science 1627 (1999) 310-317. [Reprint: 119K]
  74. Computing in groups with exponent six
    George Havas, M.F. Newman, Alice C. Niemeyer and Charles C. Sims
    Computational and Geometric Aspects of Modern Algebra, London Mathematical Society Lecture Note Series 275, Cambridge University Press (2000) 87-100. [Reprint: 204K]
  75. Some Performance Studies in Exact Linear Algebra
    George Havas and Clemens Wagner
    Distributed high performance computing and gigabit wide area networks, Lecture Notes in Control and Information Sciences 249 (1999) 161-170. [Reprint: 565K]
  76. Some challenging group presentations
    George Havas, Derek F. Holt, P.E. Kenne and Sarah Rees
    Journal of the Australian Mathematical Society (Series A) 67 (1999) 206-213. [Reprint: 452K]
  77. Finding a Low-Diameter and Low-Weight k-Connected Subgraph
    Weifa Liang, George Havas and Anne Street
    Congressus Numerantium 136 (1999) 161-175. [Preprint: 145K]
  78. Experiments in coset enumeration
    George Havas and Colin Ramsay
    Groups and Computation III, Ohio State University Mathematical Research Institute Publications 8, de Gruyter (2001) 183-192. [Preprint: 174K]
  79. Proving a group trivial made easy: a case study in coset enumeration
    George Havas and Colin Ramsay
    Bulletin of the Australian Mathematical Society 62 (2000) 105-118. [Reprint: 732K]
  80. A presentation for the Thompson sporadic simple group
    George Havas, Leonard H. Soicher and Robert A. Wilson
    Groups and Computation III, Ohio State University Mathematical Research Institute Publications 8, de Gruyter (2001) 193-200. [Preprint: 124K]
  81. Certain cyclically presented groups are infinite
    George Havas, Derek F. Holt and M.F. Newman
    Communications in Algebra 29 (2001) 5175-5178. [Reprint: 94K]
  82. Parallel coset enumeration using threads
    George Havas and Colin Ramsay
    Computer Mathematics, Proceedings of the Fourth Asian Symposium (ASCM 2000), Lecture Notes Series on Computing 8, World Scientific (2000) 29-38. [Preprint: 119K]
  83. On the complexity of the extended Euclidean algorithm (Extended Abstract)
    George Havas
    Computing: The Australasian Theory Symposium, Adelaide, 4-7 February, 2003, Electronic Notes in Theoretical Computer Science 78 (2003) 1-4 [Reprint: 94K]
  84. Efficient simple groups
    Colin M. Campbell, George Havas, Alexander Hulpke and Edmund F. Robertson
    Communications in Algebra 31 (2003) 5191-5197. [Reprint: 315K]
  85. Breadth-first search and the Andrews-Curtis conjecture
    George Havas and Colin Ramsay
    International Journal of Algebra and Computation 13 (2003) 61-68. [Reprint: 158K]
  86. Andrews-Curtis and Todd-Coxeter proof words
    George Havas and Colin Ramsay
    Groups St Andrews 2001 in Oxford, Volume I, London Mathematical Society Lecture Note Series 304, Cambridge University Press (2003) 232-237. [Preprint: 76K | Reprint: 295K]
  87. Giesbrecht's algorithm, the HFE cryptosystem and Ore's ps-polynomials
    Robert S. Coulter, George Havas and Marie Henderson
    Computer Mathematics, Proceedings of the Fifth Asian Symposium (ASCM 2001), Lecture Notes Series on Computing 8, World Scientific (2001) 36-45. [Updated postprint: 110K]
  88. Irreducible cyclic presentations of the trivial group
    George Havas and Edmund F. Robertson
    Experimental Mathematics 12 (2003) 487-490. [Reprint: 101K]
  89. Short balanced presentations of perfect groups
    George Havas and Colin Ramsay
    Groups St Andrews 2001 in Oxford, Volume I, London Mathematical Society Lecture Note Series 304, Cambridge University Press (2003) 238-243. [Preprint: 106K | Reprint: 308K]
  90. On decomposition of sub-linearised polynomials
    Robert S. Coulter, George Havas and Marie Henderson
    Journal of the Australian Mathematical Society 76 (2004) 317-328. [Reprint: 102K]
  91. On the efficiency of some finite groups
    George Havas, M.F. Newman and E.A. O'Brien
    Communications in Algebra 32 (2004) 649-656. [Reprint: 154K]
  92. 4-Engel groups are locally nilpotent
    George Havas and M. R. Vaughan-Lee
    International Journal of Algebra and Computation 15 (2005) 649-682. [Reprint: 418K | Supplementary materials]
  93. Experimenting with infinite groups, I
    Gilbert Baumslag, Sean Cleary and George Havas
    Experimental Mathematics 13 (2004) 495-502. [Reprint: 148K | Tables: 55K]
  94. Nice efficient presentations for all small simple groups and their covers
    Colin M. Campbell, George Havas, Colin Ramsay and Edmund F. Robertson
    LMS Journal of Computation and Mathematics 7 (2004) 266-283. [Reprint: 205K]
  95. Efficient presentations for the Mathieu simple group M22 and its cover
    Marston Conder, George Havas and Colin Ramsay
    Finite Geometries, Groups, and Computation (Proceedings of the conference Finite Geometries, Groups, and Computation, September 4-9, 2004, Pingree Park, Colorado, USA), Walter de Gruyter (2006) 33-42. [Preprint: 125K]
  96. Certain Roman and flock generalized quadrangles have nonisomorphic elation groups
    George Havas, C.R. Leedham-Green, E.A. O'Brien and Michael C. Slattery
    Advances in Geometry 6 (2006) 389-395. [Reprint: 94K]
  97. Computing with elation groups
    George Havas, C.R. Leedham-Green, E.A. O'Brien and Michael C. Slattery
    Finite Geometries, Groups, and Computation (Proceedings of the conference Finite Geometries, Groups, and Computation, September 4-9, 2004, Pingree Park, Colorado, USA), Walter de Gruyter (2006) 95-102. [Preprint: 105K]
  98. The Fa,b,c conjecture, I
    George Havas and Edmund F. Robertson
    Irish Mathematical Society Bulletin 56 (2005), 75-80. [Reprint: 96K]
  99. Computing with 4-Engel groups
    George Havas and M. R. Vaughan-Lee
    Groups St Andrews 2005, Volume II, London Mathematical Society Lecture Note Series 340, Cambridge University Press (2007), 457-474. [Preprint: 125K | Reprint: 476K]
  100. On proofs in finitely presented groups
    George Havas and Colin Ramsay
    Groups St Andrews 2005, Volume II, London Mathematical Society Lecture Note Series 340, Cambridge University Press (2007), 475-485. [Preprint: 188K | Reprint: 611K]
  101. The Fa,b,c conjecture is true, II
    George Havas, Edmund F. Robertson and Dale C. Sutherland
    Journal of Algebra 300 (2006), 57-72. [Reprint: 138K]
  102. Experiences with the Knuth-Bendix procedure
    Oberwolfach Report 30/2006, European Mathematical Society Publishing House (2007), 1834-1837. [Preprint: 138K]
  103. On the efficiency of the simple groups with order less than a million and their covers
    Colin M. Campbell, George Havas, Colin Ramsay and Edmund F. Robertson
    Experimental Mathematics 16 (2007), 347-358. [Reprint: 552K]
  104. Addendum to an elementary introduction to coset table methods in computational group theory
    Colin M. Campbell, George Havas and Edmund F. Robertson
    Groups St Andrews 1981 (revised edition), London Mathematical Society Lecture Note Series 71, Cambridge University Press (2007), 361-364. [Preprint: 78K | Reprint: 302K]
  105. Defining set spectra for designs can have arbitrarily large gaps
    George Havas, Julie L. Lawrence, Colin Ramsay, Anne Penfold Street and Emine Sule Yazici
    Utilitas Mathematica 75 (2008), 67-81. [Preprint: 126K]
  106. Behind and beyond a theorem on groups related to trivalent graphs
    George Havas, Edmund F. Robertson and Dale C. Sutherland
    Journal of the Australian Mathematical Society 85 (2008) 323-332. [Reprint: 130K]
  107. On counterexamples to the Hughes conjecture
    George Havas and Michael Vaughan-Lee
    Journal of Algebra 322 (2009) 791-801. [Reprint: 201K | Supplementary materials]
  108. On Coxeter's families of group presentations
    George Havas and Derek F. Holt
    Journal of Algebra 324 (2010) 1076-1082. [Reprint: 162K | Supplementary materials]
  109. On one-relator quotients of the modular group
    Marston Conder, George Havas and M.F. Newman
    Groups St Andrews 2009 in Bath, Volume I, London Mathematical Society Lecture Note Series 387, Cambridge University Press (2011), 183-197. [Preprint: 202K | Reprint: 162K | Supplementary materials]
  110. All simple groups with order from 1 million to 5 million are efficient
    Colin M. Campbell, George Havas, Colin Ramsay and Edmund F. Robertson
    International Journal of Group Theory 3 (2014) 17-30. [ Free Access]
  111. On presentations for unitary groups
    Marston Conder, George Havas, M.F. Newmani and Colin Ramsay
    Journal of Algebra (2019). [Journal link | Reprint: 310K]
Last updated: 23 December 2019

On This Site