Browse by all authors Browse By Author ID - Havas, George

Browse Results (54 results found)

Subscribe to the RSS feed for this result setSubscribe to the RSS feed for this result set

Page 1 of 2

Result Pages:    1 2  next › last »

Refine

  Abstract Views File Downloads Thomson Reuters Web of Science Citation Count Scopus Citation Count Altmetric Score
Havas, George and Vaughan-Lee, M. R. (2005) 4-Engel groups are locally nilpotent. International Journal of Algebra and Computation, 15 4: 649-682. doi:10.1142/S0218196705002475 68 3 16 Cited 14 times in Scopus14 0
Campbell, Colin M., Havas, George and Robertson, Edmund F. (1981). Addendum to an elementary introduction to coset table methods in computational group theory. In: C. M. Campbell and E. F. Robertson, Groups-St. Andrews 1981. Proceedings of an international meeting held at the University of St. Andrews 1981. Groups St Andrews 1981 Conference, St Andrews, Scotland, (361-364). 25 July - 8 August 1981. 73  
Fang, XG, Havas, G and Wang, J (1999) A family of non-quasiprimitive graphs admitting a quasiprimitive 2-arc transitive group action. European Journal of Combinatorics, 20 6: 551-557. 53   5
Majewski, BS, Wormald, NC, Havas, G and Czech, ZJ (1996) A family of perfect hashing methods. Computer Journal, 39 6: 547-554. doi:10.1093/comjnl/39.6.547 116   20 0
Campbell, C. M., Havas, G., Ramsay, C. and Robertson, E. F. (2014) All simple groups with order from 1 million to 5 million are efficient. International Journal of Group Theory, 3 1: 17-30. 70 12 Cited 0 times in Scopus0
Havas, G. and Ramsay, C. (2003). Andrews-Curtis and Todd-Coxeter proof words. In: C. Campbell, E. Robertson and G. Smith, Groups St Andrews 2001 in Oxford. Groups St Andrews 2001 in Oxford, Oxford, (232-237). 5-18 August, 2001. 57  
Ford, D and Havas, G (1996) A new algorithm and refined bounds for extended gcd computation. Algorithmic Number Theory, 1122 145-150. 43   3
Havas, G. and Sims, C. C. (1999). A presentation for the Lyons simple group. In: P Draxler, GO Michler and CM Ringel, Computational Methods For Representations of Groups and Algebras. Euroconference in Essen, Essen, (241-249). 1-5 April 1997. 28   4
Havas, G., Soicher, L.H. and Wilson, R.A. (2001). A presentation for the Thompson sporadic simple group. In: W.M. Kantor and A. Seress, Groups and Computation III: Proceedings of the International Conference at the Ohio State University. Groups and Computation, Columbus, Ohio, (193-200). 15-19 June, 2001. 43   3
Fang, X. G., Havas, G. and Wang, J. (1999). Automorphism groups of certain non-quasiprimitive almost simple graphs. In: C. M. Campbell, E. F. Robertson, N Ruskuc and G. C. Smith, London Mathematical Society Lecture Notes Series 260. Groups St Andrews 1997 in Bath, 1, Bath, (267-274). 26 July - 9 August 1997. 35  
Havas, George, Robertson, Edmund F. and Sutherland, Dale C. (2008) Behind and beyond a theorem on groups related to trivalent graphs. Journal of the Australian Mathematical Society, 85 3: 323-332. doi:10.1017/S1446788708000852 46   0 Cited 0 times in Scopus0 0
Havas, G. and Ramsay, C. (2003) Breadth-first search and the Andrews-Curtis conjecture. International Journal of Algebra And Computation, 13 1: 61-68. doi:10.1142/S0218196703001365 67 6 5 Cited 7 times in Scopus7 0
Havas, G., Holt, D. F. and Newman, M. F. (2001) Certain cyclically presented groups are infinite. Communications In Algebra, 29 11: 5175-5178. 49   0
Havas, G., Leedham-Green, C. R., OBrien, E. A. and Slattery, M. C. (2006) Certain Roman and flock generalized quadrangles have nonisomorphic elation groups. Advances In Geometry, 6 3: 389-395. doi:10.1515/ADVGEOM.2006.024 41   2 Cited 3 times in Scopus3 0
Havas, G., Newman, M. F., Niemeyer, A. C. and Sims, C. C. (2000). Computing in groups with exponent six. In: M. Atkinson, N. Gilbert, J. Howie, S. Linton and E. Robertson, IMCS Workshop on Computational and Geometric Aspects of Modern Algebra. Computational and Geometric Aspects of Modern Algebra, Heriot-Watt University, Edinburgh, UK, (87-100). 23-31 July 1998. 38  
Havas, George and Vaughan-Lee, M. R. (2007). Computing with 4-Engel groups. In: Campbell, C.M., Quick, M.R., Robertson, E.F. and Smith, G.C., Groups St Andrews 2005. Groups St Andrews 2005, St Andrews, Scotland, (475-485). 30 July - 6 August, 2005. 35  
Havas, George, Leedham-Green, C. R., O'Brien, E. A. and Slattery, Michael C. (2006). Computing with elation groups. In: A. Hulpke, R. Liebler, T. Penttila and A. Seress, Finite Geometries, Groups, and Computation: Proceedings of the Conference. Finite Geometries, Groups, and Computation, Colorado, USA, (95-102). 4-9 September, 2004. 52  
Havas, George, Lawrence, Julie L., Ramsay, Colin, Street, Anne Penfold and Yazici, Emine Sule (2008) Defining Set Spectra for Designs can have Arbitrarily Large Gaps. Utilitas Mathematica, 75 67-81. 67 1 6 Cited 6 times in Scopus6
Conder, Marston, Havas, George and Ramsay, Colin (2006). Efficient presentations for the Mathieu simple group M22 and its cover. In: A. Hulpke, R. Liebler, T. Penttila and A. Seress, Finite Geometries, Groups, and Compuation, Proceedings of the Conference Finite Geometries, Groups, and Computation. Finite Geometries, Groups, and Computation, Pingree Park, CO, United States, (33-41). 4-9 September 2004. 61 1
Campbell, C. M., Havas, G., Hulpke, A. and Robertson, E. F. (2003) Efficient simple groups. Communications In Algebra, 31 10: 5191-5197. doi:10.1081/AGB-120023154 35   1 Cited 1 times in Scopus1 0
Cooper, G. and Havas, G. (1999). Elementary algebra revisited: Randomized algorithms. In: P Pardalos, S Rajasekaran and J Rolim, Series in Discrete Mathematics and Theoretical Computer Science: Randomization Methods in Algorithm Design. DIMACS, Princeton Univ., (37-44). 12-14 December 1997. 27  
Havas, George (2007). Experiences with the Knuth-Bendix procedure. In: Oberwolfach Reports 30/2006. Computational Group Theory, xx, (1834-1837). 2-8 July, 2006. 59  
Baumslag, G, Cleary, S and Havas, G (2004) Experimenting with infinite groups, I. Experimental Mathematics, 13 4: 495-502. 50 5 1 Cited 4 times in Scopus4
Havas, G. and Ramsay, C. (2001). Experiments in coset enumeration. In: W.M. Kantor and A. Seress, Groups and Computation III: Proceedings of the International Conference at the Ohio State University. Groups and Computation, Columbus, Ohio, (183-192). 15-19 June, 1999. 48   3
Havas, G, Majewski, BS and Matthews, KR (1998) Extended GCD and Hermite normal form algorithms via lattice basis reduction. Experimental Mathematics, 7 2: 125-136. 53   18
Havas, G, Majewski, BS and Matthews, KR (1999) Extended GCD and hermite normal form algorithms via lattice basis reduction (vol 7, pg 125, 1998). Experimental Mathematics, 8 205-205. 40   0
Liang, W., Havas, G. and Street, A. P. (1999). Finding a low-diameter and low-weight k-connected subgraph. In: R. G. Stanton and J. L. Allston, 30th Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congress Numerantium, Boca Roton, Florida, (161-175). 8-12 March 1999. 34  
Cooper, G., Feiser, S., Gathen, J. V. and Havas, G. (1999). GCD of many integers. In: Asano, Imai, Lee, Nakano and Tokyyama, Computing and Combinatorics Lecture Notes in Computer Science. COCOON'99, Tokyo, (310-317). 26-28 July 1999. 71  
Coulter, R., Havas, G. and Henderson, M. (2001). Giesbrecht's algorithm, the HFE crypotsystem and Ore's ps-polynomials. In: K. Shirayayanagi and K. Yokoyama, Computer Mathematics: Proceedins of the Fifth Asian Symposium (ASCM 2001). Fifth Asian Symposium on Computer Mathematics (ASCM 2001), Matsuyama, Japan, (36-45). 26-28 September, 2001. 53  
Havas, G, Newman, MF, Niemeyer, AC and Sims, CC (1999) Groups with exponent six. Communications In Algebra, 27 8: 3619-3638. doi:10.1080/00927879908826651 42   4 0
Havas, G and Majewski, BS (1997) Integer matrix diagonalization. Journal of Symbolic Computation, 24 3-4: 399-408. doi:10.1006/jsco.1996.0141 62   15 0
Havas, G. and Robertson, E. F. (2003) Irreducible cyclic presentations of the trivial group. Experimental Mathematics, 12 4: 487-490. 43   7 Cited 7 times in Scopus7
Campbell, C.M., Havas, G., Ramsay, C. and Robertson, E.F. (2004) Nice efficient presentation for all small simple groups and their covers. LMS Journal of Computation and Mathematics, 7 266-283. 74  
Havas, George and Vaughan-Lee, Michael (2009) On counterexamples to the Hughes conjecture. Journal of Algebra, 322 3: 791-801. doi:10.1016/j.jalgebra.2009.04.011 36   0 Cited 0 times in Scopus0 0
Havas, George and Holt, Derek F. (2010) On Coxeter's families of group presentations. Journal of Algebra, 324 5: 1076-1082. doi:10.1016/j.jalgebra.2010.02.043 40 2 1 Cited 2 times in Scopus2 0
Coulter, R. S., Havas, G. and Henderson, M. (2004) On decomposition of sub-linearised polynomials. Journal of the Australian Mathematical Society, 78 3: 317-328. 51   1 Cited 3 times in Scopus3
Conder, Marston, Havas, George and Newman, M. F. (2011). On one-relator quotients of the modular group. In: C. M. Campbell, M. R. Quick, E. F. Robertson, C. M. Roney-Dougal, G. C. Smith and G. Traustason, Groups St Andrews 2009 in Bath, Volume 1. Groups St Andrews 2009 in Bath, Bath, United Kingdom, (183-197). 1-15 August 2009. 40 3
Havas, George and Ramsay, Colin (2007). On proofs in finitely presented groups. In: Campbell, C.M., Quick, M.R., Robertson, E.F. and Smith, G.C., Groups St Andrews 2005. Groups St Andrews 2005, St Andrews, Scotland, (457-474). 30 July - 6 August, 2005. 46  
Gai, J., Havas, G., Mans, B., Nerurkar, A., Seifert, J. and Shparlinski, I. (1999). On routing in circulant graphs. In: Asano, Imai, Lee, Nakano and Tokyyama, Computing and Combinatorics Lecture Notes in Computer Science. COCOON'99, Tokyo, (360-369). 26-28 July 1999. 40  
Gollan, H. W. and Havas, G. (1999). On Sims' presentation for Lyons' simple group. In: P Draxler, GO Michler and CM Ringel, Computational Methods for Representations of Groups and Algebras. Euroconference in Essen, Essen, (235-240). 1-5 April 1997. 33  
Fang, XG, Havas, G and Praeger, CE (1999) On the automorphism groups of quasiprimitive almost simple graphs. Journal of Algebra, 222 1999: 271-283. doi:10.1006/jabr.1999.8020 49   6 0
Havas, G. (2003). On the complexity of the extended Euclidean algorithm. In: J. Harland, Computing: The Australasian Theory Symposium, Electronic Notes in Theoretical Computer Science. Computing: The Australasian Theory Symposium, Electronic Notes in Theoretical Computer Science, Adelaide, (1-4). 4-7 February, 2003. 148  
Havas, G, Newman, MF and OBrien, EA (2004) On the efficiency of some finite groups. Communications In Algebra, 32 2: 649-656. doi:10.1081/AGB-120027920 27   2 Cited 3 times in Scopus3 0
Campbell, Colin M., Havas, George, Ramsay, Colin and Robertson, Edmund F. (2007) On the efficiency of the simple groups of order less than a million and their covers. Experimental Mathematics, 16 3: 347-358. doi:10.1080/10586458.2007.10129006 63 3 2 Cited 3 times in Scopus3 0
Havas, G. and Ramsay, C. (2000). Parallel COSET enumeration using threads. In: X-S Gao and D Wang, Proceedings of the Fourth Asian Symposium: ASCM 2000. ASCM 2000, Thailand, (29-38). 17-21 December 2000. 37  
Czech, ZJ, Havas, G and Majewski, BS (1997) Perfect hashing. Theoretical Computer Science, 182 1-2: 1-143. doi:10.1016/S0304-3975(96)00146-6 92   55 Cited 46 times in Scopus46 0
Cooperman, G and Havas, G (1997) Practical parallel coset enumeration. Workshop On High Performance Computing And Gigabit Local Area Networks, 226 15-27. 29   7
Havas, George and Ramsay, Colin (2000) Proving a group trivial made easy: A case study in COSET enumeration. Bulletin of the Australian Mathematical Society, 62 2000: 105-118. 34   5 Cited 5 times in Scopus5
Havas, G. and Ramsay, C. (2003). Short balanced presentations of perfect groups. In: C. Campbell, E. Robertson and G. Smith, Groups St Andrews 2001 in Oxford. Groups St Andrews 2001 in Oxford, Oxford, (238-243). 5-18 August, 2001. 32  
Havas, G., Holt, D. F., Kenne, P. E. and Rees, S. (1999) Some challenging group presentations. Journal of The Australian Mathematical Society (Series A), 67 206-213. 41   2

Page 1 of 2

Result Pages:    1 2  next › last »