Selected Publications (1969 to 1989)

    TITLE: Lattices with sublattices of a given order
    AUTHORS: George Havas and Martin Ward
    CITATION: J. Combinatorial Theory 7 (1969) 281-282
    Math. Rev. 40#1308 (R. P. Dilworth); Zbl. 179.32002

    TITLE: Implementation and analysis of the Todd-Coxeter algorithm
    AUTHORS: John J. Cannon, Lucien A. Dimino, George Havas and Jane M. Watson
    CITATION: Math. Comp. 27 (1973) 463-490
    Math. Rev. 49 390 (Hale F. Trotter); Zbl. 314.20028

    TITLE: A Reidemeister-Schreier program
    AUTHOR: George Havas
    CITATION: Proceedings of the Second International Conference on the Theory of Groups, Lecture Notes in Mathematics 372 (1974) 347-356
    Math. Rev. 51 13002 (F. Levin); Zbl. 288.20047

    TITLE: The two generator restricted Burnside group of exponent five
    AUTHORS: George Havas, G.E. Wall and J.W. Wamsley
    CITATION: Bulletin of the Australian Mathematical Society 10 (1974) 459-470
    Math. Rev. 51 3298 (R. R. Struik); Zbl. 277.20025

    TITLE: Defining relations for the Held-Higman-Thompson simple group
    AUTHORS: John J. Cannon and George Havas
    CITATION: Bulletin of the Australian Mathematical Society 11 (1974) 43-46
    Math. Rev. 50 13242 (F. A. Sherk); Zbl. 279.20027

    TITLE: Computational approaches to combinatorial group theory
    AUTHOR: George Havas
    CITATION: Bulletin of the Australian Mathematical Society 11 (1974) 475-476
    Zbl. 284.20036

    TITLE: Some complexity problems in algebraic computations
    AUTHOR: George Havas
    CITATION: Proceedings The Complexity of Computational Problem Solving, University of Queensland Press (1976) 184-192.

    TITLE: Computer aided determination of a Fibonacci group
    AUTHOR: George Havas
    CITATION: Bulletin of the Australian Mathematical Society 15 (1976) 297-305
    Math. Rev. 54 12907 (E.F. Robertson); Zbl. 332.20012

    TITLE: Collection
    AUTHORS: George Havas and Tim Nicholson
    CITATION: 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

    TITLE: A computer aided classification of certain groups of prime power order
    AUTHORS: Judith A. Ascione, George Havas and C.R. Leedham-Green
    CITATION: Bulletin of the Australian Mathematical Society 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

    TITLE: Groups of exponent eight.
    AUTHORS: Fritz J. Grunewald, George Havas, J.L. Mennicke and M.F. Newman
    CITATION: Bulletin of the Australian Mathematical Society 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.

    TITLE: Integer matrices and abelian groups
    AUTHORS: George Havas and Leon S. Sterling
    CITATION: Symbolic and algebraic computation, Lecture Notes in Computer Science 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.

    TITLE: The last of the Fibonacci groups.
    AUTHORS: George Havas, J.S. Richardson and Leon S. Sterling
    CITATION: 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.

    TITLE: Application of computers to questions like those of Burnside
    AUTHORS: George Havas and M.F. Newman
    CITATION: Burnside groups, Lecture Notes in Mathematics 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.

    TITLE: Groups of exponent eight
    AUTHORS: Fritz J. Grunewald, George Havas, J.L. Mennicke and M.F. Newman
    CITATION: Burnside groups, Lecture Notes in Mathematics 806 (1980) 49-188
    Math. Rev. 82d:20039a (Peter M. Neumann); Zbl. 456.20019

    TITLE: Commutators in groups expressed as products of powers
    AUTHOR: George Havas
    CITATION: Communications in Algebra 9 (1981) 115-129
    Math. Rev. 82c:20070 (Colin M. Campbell)

    TITLE: HYPERdisk, an access method for remote disk devices
    AUTHOR: George Havas
    CITATION: 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.

    TITLE: The CSIRO HYPERchannel local computer network
    AUTHORS: George Havas
    CITATION: Proceedings Symposium on Local Area Networks (1982) 5pp.

    TITLE: Groups of exponent five and class four
    AUTHORS: George Havas and J.S. Richardson
    CITATION: Communications in Algebra 11 (1983) 287-304
    Math. Rev. 84f:20035 (E.I. Khukhro); Zbl. 502.20017

    TITLE: Minimal presentations for finite groups of prime-power order
    AUTHORS: George Havas and M.F. Newman
    CITATION: Communications in Algebra 11 (1983) 2267-2275
    Math. Rev. 84k:20015 (J. Mennicke); Zbl. 523.20022

    TITLE: Two groups which act on cubic graphs
    AUTHORS: George Havas and Edmund F. Robertson
    CITATION: Computational group theory, Academic Press (1984) 65-68
    Math. Rev. 86b:05038 (G. Laman); Zbl. 548.05032 (D.A. Holton)

    TITLE: A Tietze transformation program
    AUTHORS: George Havas, P.E. Kenne, J.S. Richardson and E.F. Robertson
    CITATION: 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.

    TITLE: Distinguishing eleven crossing knots
    AUTHORS: George Havas and L. G. Kovács
    CITATION: Computational group theory, Academic Press (1984) 367-373
    Math. Rev. 86i:57007 (Jonathan A. Hillman); Zbl. 554.57005 (K. Murasugi)

    TITLE: Local Computer Network Systems at CSIRO [In Japanese]
    AUTHORS: George Havas and T. Tsukomoto
    CITATION: FUJITSU 35 (1984) 107-115.

    TITLE: CSIRONET - A national network for computer communication
    AUTHORS: George Havas and P.J. Claringbold
    CITATION: Proceedings ICCC'84 (1984) 56-63.

    TITLE: CSIRONET research and development in Australia
    AUTHORS: George Havas and P.J. Claringbold
    CITATION: Proceedings World Computing Services Industry Conference IV (1984) 41-44.

    TITLE: User experience with a very high speed local network
    AUTHOR: George Havas
    CITATION: Proceedings Lancon 84 (1984) 232-237.

    TITLE: The connection between the Australian Bibliographic Network and CSIRONET
    AUTHORS: W.S. Ford, George Havas and J.E. Paine
    CITATION: Proceedings Second National ABN Conference (1985) 123-128.

    TITLE: CSIRONET facilities for industry and government
    AUTHORS: George Havas and P.J. Claringbold
    CITATION: Proceedings First Pan Pacific Computer Conference (1985) 116, 1494-1515.

    TITLE: The integration of diverse technologies by CSIRONET
    AUTHOR: George Havas
    CITATION: Proceedings VALA Third National Conference on Library Automation (1985) 37-41.

    TITLE: Software product development and export
    AUTHORS: George Havas and Howard Kadetz
    CITATION: Proceedings ACC '86 (1986) 326-330

Last updated: 17 February 2003