Selected Publications before 1990.

  1. Software product development and export.
    George Havas and Howard Kadetz,
    Proceedings ACC '86 (1986) 326-330.
  2. The integration of diverse technologies by CSIRONET.
    George Havas,
    Proceedings VALA Third National Conference on Library Automation (1985) 37-41.
  3. CSIRONET facilities for industry and government.
    George Havas and P.J. Claringbold,
    Proceedings First Pan Pacific Computer Conference (1985) 116, 1494-1515.
  4. The connection between the Australian Bibliographic Network and CSIRONET.
    W.S. Ford, George Havas and J.E. Paine,
    Proceedings Second National ABN Conference (1985) 123-128.
  5. User experience with a very high speed local network.
    George Havas,
    Proceedings Lancon 84 (1984) 232-237.
  6. CSIRONET research and development in Australia.
    George Havas and P.J. Claringbold,
    Proceedings World Computing Services Industry Conference IV (1984) 41-44.
  7. CSIRONET - A national network for computer communication.
    George Havas and P.J. Claringbold,
    Proceedings ICCC'84 (1984) 56-63.
  8. Local Computer Network Systems at CSIRO [In Japanese].
    George Havas and T. Tsukomoto,
    FUJITSU 35 (1984) 107-115.
  9. Distinguishing eleven crossing knots.
    George Havas and L. G. Kovács,
    Computational group theory, Academic Press (1984) 367-373.
    Math. Rev. 86i:57007 (Jonathan A. Hillman); Zbl. 554.57005 (K. Murasugi)
  10. A Tietze transformation program.
    George Havas, P.E. Kenne, J.S. Richardson and E.F. Robertson,
    Computational group theory, Academic Press (1984) 69-73.
    Zbl. 569.20002 (G. Butler)
    ABSTRACT: A Reidemeister-Schreier program which yields a presentation of a subgroup H of finite index in a finitely presented group G was described by Havas [Proceedings of the second international conference on the theory of groups, Lecture Notes in Math. 372 (1974) 347-356; MR 51#13002]. The program has two stages: first, Schreier generators and Reidemeister relators for H are computed; then the resulting presentation is simplified by eliminating redundant generators and by using a substring searching technique. The Tietze transformation program which we describe in this paper was originally designed to improve the simplification stage of that Reidemeister-Schreier program and now also forms part of the implementation of the modified Todd-Coxeter method [D. G. Arrell and Robertson, Computational group theory, Academic Press (1984) 27-32]. The program described here is written in a reasonably portable superset of FORTRAN 66, and was available at the symposium.
  11. Two groups which act on cubic graphs.
    George Havas and Edmund F. Robertson,
    Computational group theory, Academic Press (1984) 65-68.
    Math. Rev. 86b:05038 (G. Laman); Zbl. 548.05032 (D.A. Holton)
  12. Minimal presentations for finite groups of prime-power order.
    George Havas and M.F. Newman,
    Comm. Algebra 11 (1983) 2267-2275.
    Math. Rev. 84k:20015 (J. Mennicke); Zbl. 523.20022
  13. Groups of exponent five and class four.
    George Havas and J.S. Richardson,
    Comm. Algebra 11 (1983) 287-304.
    Math. Rev. 84f:20035 (E.I. Khukhro); Zbl. 502.20017
  14. The CSIRO HYPERchannel local computer network.
    George Havas,
    Proceedings Symposium on Local Area Networks (1982) 5pp.
  15. HYPERdisk, an access method for remote disk devices.
    George Havas,
    Australian Computer Journal 13 (1981) 64-65.
    ABSTRACT: A method currently under development for accessing IBM-compatible disk devices from IBM-compatible is described. The method is transparent to application programmer and utility user. It for data transfer over the Network Systems HYPERchannel which is the basis of the local computer network.
  16. Commutators in groups expressed as products of powers.
    George Havas,
    Comm. Algebra 9 (1981) 115-129.
    Math. Rev. 82c:20070 (Colin M. Campbell)
  17. 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.
    Math. Rev. 82d:20039a (Peter M. Neumann); Zbl. 456.20019
  18. 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.
    Math. Rev. 82d:20002 (Colin M. Campbell)
    ABSTRACT: Computers have been used in seeking answers to questions related to those about periodic groups asked by Burnside in his influential paper of 1902. A survey is given of results obtained with the aid of computers and a key program which manipulates presentations for groups of prime-power order is described.
  19. The last of the Fibonacci groups.
    George Havas, J.S. Richardson and Leon S. Sterling,
    Proc. Roy. Soc. Edinburgh 83A (1979) 199-203.
    ABSTRACT:All the Fibonacci groups in the family F(2,n) have been either fully identified or determined to be infinite, bar one, namely F(2,9). By using computer-aided techniques it is shown that F(2,9) has a quotient of order 152x5741, and an explicit matrix representation for a quotient of order 152x518 is given. This strongly suggests that F(2,9) is infinite, but no proof of such a claim is available.
  20. Integer matrices and abelian groups.
    George Havas and Leon S. Sterling,
    Symbolic and algebraic computation, Lecture Notes in Comput. Sci. 72 (1979) 431-451.
    ABSTRACT: Practical methods for computing equivalent forms of integer matrices are presented. Both heuristic and modular techniques are used to overcome integer overflow problems and have successfully handled matrices with hundreds of rows and columns. Applications to finding the structure of finitely presented abelian groups are described.
  21. Groups of exponent eight.
    Fritz J. Grunewald, George Havas, J.L. Mennicke and M.F. Newman,
    Bull. Austral. Math. Soc. 20 (1979) 7-16.
    ABSTRACT: This paper is a survey of the current state of knowledge on groups of exponent 8. It contains a report on a first stage of an attempt to answer the Burnside questions for these groups.
  22. A computer aided classification of certain groups of prime power order.
    Judith A. Ascione, George Havas and C.R. Leedham-Green,
    Bull. Austral. Math. Soc. 17 (1977) 257-274. Corrigendum: ibid. 317-319.
    Microfiche supplement: ibid. 320.
    ABSTRACT: A classification of two-generator 3-groups of second maximal class and low order is presented. All such groups with orders up to 38 are described, and in some cases with orders up to 310. The classification is based on computer aided computations. A description of the computations and their results are presented, together with an indication of their significance.
    Math. Rev. 57 9808; Zbl. 359.20018
  23. Collection.
    George Havas and Tim Nicholson,
    Proceedings SYMSAC '76, ACM Symposium on Symbolic and Algebraic Computation, ACM (1976) 9-14.
    ABSTRACT: Collection processes have been the basis of group investigations by many people, some using hand calculation, some machine calculation. We describe a collection process which is specially efficient in the context of nilpotent quotient algorithm programs. The principles underlying our collection process are applicable in general.
    Zbl. 455.20003
  24. Computer aided determination of a Fibonacci group.
    George Havas,
    Bull. Austral. Math. Soc. 15 (1976) 297-305.
    Math. Rev. 54 12907 (E.F. Robertson); Zbl. 332.20012
  25. Some complexity problems in algebraic computations.
    George Havas,
    Proceedings The Complexity of Computational Problem Solving, University of Queensland Press (1976) 184-192.
  26. Computational approaches to combinatorial group theory.
    George Havas,
    Bull. Austral. Math. Soc. 11 (1974) 475-476.
    Zbl. 284.20036
  27. Defining relations for the Held-Higman-Thompson simple group.
    John J. Cannon and George Havas,
    Bull. Austral. Math. Soc. 11 (1974) 43-46.
    Math. Rev. 50 13242 (F. A. Sherk); Zbl. 279.20027
  28. 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.
    Math. Rev. 51 3298 (R. R. Struik); Zbl. 277.20025
  29. A Reidemeister-Schreier program.
    George Havas,
    Proceedings of the Second International Conference on the Theory of Groups, Lecture Notes in Math. 372 (1974) 347-356.
    Math. Rev. 51 13002 (F. Levin); Zbl. 288.20047
  30. 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.
    Math. Rev. 49 390 (Hale F. Trotter); Zbl. 314.20028
  31. Lattices with sublattices of a given order.
    George Havas and Martin Ward,
    J. Combinatorial Theory 7 (1969) 281-282.
    Math. Rev. 40#1308 (R. P. Dilworth); Zbl. 179.32002

Last updated: 17 February 2003