George Havas

Publication Activity (10 Years)

Years Active: 1976-2007
Publications (10 Years): 0

Publications

Colin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson
On the Efficiency of the Simple Groups of Order Less Than a Million and Their Covers. Exp. Math. 16 (3) (2007)
George Havas, Michael R. Vaughan-Lee
4-Engel Groups are Locally Nilpotent. Int. J. Algebra Comput. 15 (4) (2005)
Gilbert Baumslag, Sean Cleary, George Havas
Experimenting with Infinite Groups, I. Exp. Math. 13 (4) (2004)
George Havas, Colin Ramsay
Breadth-First Search and the Andrews-Curtis Conjecture. Int. J. Algebra Comput. 13 (1) (2003)
George Havas
On the Complexity of the Extended Euclidean Algorithm (extended abstract). Electron. Notes Theor. Comput. Sci. 78 (2003)
George Havas, Edmund F. Robertson
Irreducible Cyclic Presentations of the Trivial Group. Exp. Math. 12 (4) (2003)
Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas
GCD of Many Integers. COCOON (1999)
George Havas, Jean-Pierre Seifert
The Complexity of the Extended GCD Problem. MFCS (1999)
Xin Gui Fang, George Havas, Jie Wang
A Family of Non-quasiprimitive Graphs Admitting a Quasiprimitive 2-arc Transitive Group Action. Eur. J. Comb. 20 (6) (1999)
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski
On Routing in Circulant Graphs. COCOON (1999)
George Havas, Bohdan S. Majewski, Keith R. Matthews
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata). Exp. Math. 8 (2) (1999)
George Havas, Clemens Wagner
Some Performance Studies in Exact Linear Algebra. Wide Area Networks and High Performance Computing (1998)
Weifa Liang, George Havas
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. CATS (1998)
Weifa Liang, George Havas, Xiaojun Shen
Improved Lightpath (Wavelength) Routing in Large WDM Networks. ICDCS (1998)
George Havas, Bohdan S. Majewski, Keith R. Matthews
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction. Exp. Math. 7 (2) (1998)
Zbigniew J. Czech, George Havas, Bohdan S. Majewski
Perfect Hashing. Theor. Comput. Sci. 182 (1-2) (1997)
Xin Gui Fang, George Havas
On the Worst-case Complexity of Integer Gaussian Elimination. ISSAC (1997)
S. A. M. Makki, George Havas
An Efficient Method for Constructing a Distributed Depth-First Search Tree. PDPTA (1997)
George Havas
Bohdan S. Majewski: Integer Matrix Diagonalization. J. Symb. Comput. 24 (3/4) (1997)
Gene Cooperman, George Havas
Elementary algebra revisited: Randomized algorithms. Randomization Methods in Algorithm Design (1997)
Weifa Liang, George Havas
NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph. Euro-Par (1997)
David Ford, George Havas
A New Algorithm and Refined Bounds for Extended Gcd Computation. ANTS (1996)
S. A. M. Makki, George Havas
Distributed Algorithms for Depth-First Search. Inf. Process. Lett. 60 (1) (1996)
Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech
A Family of Perfect Hashing Methods. Comput. J. 39 (6) (1996)
George Havas, Bohdan S. Majewski
A Hard Problem That is Almost Always Easy. ISAAC (1995)
Bohdan S. Majewski, George Havas
A Solution to the Extended GCD Problem. ISSAC (1995)
Bohdan S. Majewski, George Havas
The complexity of greatest common divisor computations. ANTS (1994)
S. A. M. Makki, George Havas
Distributed Algorithms for Constructing a Depth-First-Search Tree. ICPP (3) (1994)
George Havas, Jin Xian Lian
A New Problem in String Searching. ISAAC (1994)
George Havas, Mike F. Newman, Eamonn A. O'Brien
Groups of deficiency zero. Geometric and Computational Perspectives on Infinite Groups (1994)
George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
Graphs, Hypergraphs and Hashing. WG (1993)
Zbigniew J. Czech, George Havas, Bohdan S. Majewski
An Optimal Algorithm for Generating Minimal Perfect Hash Functions. Inf. Process. Lett. 43 (5) (1992)
John J. Cannon, George Havas
Algorithms for Groups. Aust. Comput. J. 24 (2) (1992)
George Havas, Edmund F. Robertson
Application of Computational Tools for Finitely Presented Groups. Computational Support for Discrete Mathematics (1992)
George Havas
Coset Enumeration Strategies. ISSAC (1991)
George Havas, Mike F. Newman, Michael R. Vaughan-Lee
A Nilpotent Quotient Algorithm for Graded Lie Rings. J. Symb. Comput. 9 (5/6) (1990)
George Havas
Hyperdisk, an access method for remote disk devices. Aust. Comput. J. 13 (2) (1981)
George Havas, Leon Sterling
Integer matrices and Abelian groups (invited). EUROSAM (1979)
George Havas, Tim Nicholson
Collection. SYMSACC (1976)