Collection. - George Havas; Tim Nicholson (SYMSACC, 1976)

Integer matrices and Abelian groups (invited). - George Havas; Leon Sterling (EUROSAM, 1979)

Hyperdisk, an access method for remote disk devices. - George Havas (Aust. Comput. J., 1981)

A Nilpotent Quotient Algorithm for Graded Lie Rings. - George Havas; Mike F. Newman; Michael R. Vaughan-Lee (J. Symb. Comput., 1990)

Coset Enumeration Strategies. - George Havas (ISSAC, 1991)

Application of Computational Tools for Finitely Presented Groups. - George Havas; Edmund F. Robertson (Computational Support for Discrete Mathematics, 1992)

Algorithms for Groups. - John J. Cannon; George Havas (Aust. Comput. J., 1992)

An Optimal Algorithm for Generating Minimal Perfect Hash Functions. - Zbigniew J. Czech; George Havas; Bohdan S. Majewski (Inf. Process. Lett., 1992)

Graphs, Hypergraphs and Hashing. - George Havas; Bohdan S. Majewski; Nicholas C. Wormald; Zbigniew J. Czech (WG, 1993)

The complexity of greatest common divisor computations. - Bohdan S. Majewski; George Havas (ANTS, 1994)

Groups of deficiency zero. - George Havas; Mike F. Newman; Eamonn A. O'Brien (Geometric and Computational Perspectives on Infinite Groups, 1994)

Distributed Algorithms for Constructing a Depth-First-Search Tree. - S. A. M. Makki; George Havas (ICPP (3), 1994)

A New Problem in String Searching. - George Havas; Jin Xian Lian (ISAAC, 1994)

A Hard Problem That is Almost Always Easy. - George Havas; Bohdan S. Majewski (ISAAC, 1995)

A Solution to the Extended GCD Problem. - Bohdan S. Majewski; George Havas (ISSAC, 1995)

A New Algorithm and Refined Bounds for Extended Gcd Computation. - David Ford 001; George Havas (ANTS, 1996)

A Family of Perfect Hashing Methods. - Bohdan S. Majewski; Nicholas C. Wormald; George Havas; Zbigniew J. Czech (Comput. J., 1996)

Distributed Algorithms for Depth-First Search. - S. A. M. Makki; George Havas (Inf. Process. Lett., 1996)

Elementary algebra revisited: Randomized algorithms. - Gene Cooperman; George Havas (Randomization Methods in Algorithm Design, 1997)

NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph. - Weifa Liang; George Havas (Euro-Par, 1997)

On the Worst-case Complexity of Integer Gaussian Elimination. - Xin Gui Fang; George Havas (ISSAC, 1997)

An Efficient Method for Constructing a Distributed Depth-First Search Tree. - S. A. M. Makki; George Havas (PDPTA, 1997)

Bohdan S. Majewski: Integer Matrix Diagonalization. - George Havas (J. Symb. Comput., 1997)

Perfect Hashing. - Zbigniew J. Czech; George Havas; Bohdan S. Majewski (Theor. Comput. Sci., 1997)

Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. - Weifa Liang; George Havas (CATS, 1998)

Improved Lightpath (Wavelength) Routing in Large WDM Networks. - Weifa Liang; George Havas; Xiaojun Shen 002 (ICDCS, 1998)

Some Performance Studies in Exact Linear Algebra. - George Havas; Clemens Wagner 002 (Wide Area Networks and High Performance Computing, 1998)

Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction. - George Havas; Bohdan S. Majewski; Keith R. Matthews (Exp. Math., 1998)

On Routing in Circulant Graphs. - Jin-yi Cai; George Havas; Bernard Mans; Ajay Nerurkar; Jean-Pierre Seifert; Igor E. Shparlinski (COCOON, 1999)

GCD of Many Integers. - Gene Cooperman; Sandra Feisel; Joachim von zur Gathen; George Havas (COCOON, 1999)

The Complexity of the Extended GCD Problem. - George Havas; Jean-Pierre Seifert (MFCS, 1999)

A Family of Non-quasiprimitive Graphs Admitting a Quasiprimitive 2-arc Transitive Group Action. - Xin Gui Fang; George Havas; Jie Wang 038 (Eur. J. Comb., 1999)

Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata). - George Havas; Bohdan S. Majewski; Keith R. Matthews (Exp. Math., 1999)

Irreducible Cyclic Presentations of the Trivial Group. - George Havas; Edmund F. Robertson (Exp. Math., 2003)

On the Complexity of the Extended Euclidean Algorithm (extended abstract). - George Havas (CATS, 2003)

Breadth-First Search and the Andrews-Curtis Conjecture. - George Havas; Colin Ramsay (Int. J. Algebra Comput., 2003)

Experimenting with Infinite Groups, I. - Gilbert Baumslag; Sean Cleary; George Havas (Exp. Math., 2004)

Nice Efficient Presentions for all Small Simple Groups and their Covers. - Colin M. Campbell; George Havas; Colin Ramsay; Edmund F. Robertson (LMS J. Comput. Math., 2004)

4-Engel Groups are Locally Nilpotent. - George Havas; Michael R. Vaughan-Lee (Int. J. Algebra Comput., 2005)

On the Efficiency of the Simple Groups of Order Less Than a Million and Their Covers. - Colin M. Campbell; George Havas; Colin Ramsay; Edmund F. Robertson (Exp. Math., 2007)