George Havas

Affiliations:
  • University of Queensland, Brisbane, Australia


According to our database1, George Havas authored at least 40 papers between 1976 and 2007.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2007
On the Efficiency of the Simple Groups of Order Less Than a Million and Their Covers.
Exp. Math., 2007

2005
4-Engel Groups are Locally Nilpotent.
Int. J. Algebra Comput., 2005

2004
Nice Efficient Presentions for all Small Simple Groups and their Covers.
LMS J. Comput. Math., 2004

Experimenting with Infinite Groups, I.
Exp. Math., 2004

2003
Breadth-First Search and the Andrews-Curtis Conjecture.
Int. J. Algebra Comput., 2003

On the Complexity of the Extended Euclidean Algorithm (extended abstract).
Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

Irreducible Cyclic Presentations of the Trivial Group.
Exp. Math., 2003

1999
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata).
Exp. Math., 1999

A Family of Non-quasiprimitive Graphs Admitting a Quasiprimitive 2-arc Transitive Group Action.
Eur. J. Comb., 1999

The Complexity of the Extended GCD Problem.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

GCD of Many Integers.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

On Routing in Circulant Graphs.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction.
Exp. Math., 1998

Some Performance Studies in Exact Linear Algebra.
Proceedings of the Workshop on Wide Area Networks and High Performance Computing, 1998

Improved Lightpath (Wavelength) Routing in Large WDM Networks.
Proceedings of the 18th International Conference on Distributed Computing Systems, 1998

Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
Perfect Hashing.
Theor. Comput. Sci., 1997

Bohdan S. Majewski: Integer Matrix Diagonalization.
J. Symb. Comput., 1997

An Efficient Method for Constructing a Distributed Depth-First Search Tree.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

On the Worst-case Complexity of Integer Gaussian Elimination.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Elementary algebra revisited: Randomized algorithms.
Proceedings of the Randomization Methods in Algorithm Design, 1997

1996
Distributed Algorithms for Depth-First Search.
Inf. Process. Lett., 1996

A Family of Perfect Hashing Methods.
Comput. J., 1996

A New Algorithm and Refined Bounds for Extended Gcd Computation.
Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

1995
A Solution to the Extended GCD Problem.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

A Hard Problem That is Almost Always Easy.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994
A New Problem in String Searching.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Distributed Algorithms for Constructing a Depth-First-Search Tree.
Proceedings of the 1994 International Conference on Parallel Processing, 1994

Groups of deficiency zero.
Proceedings of the Geometric and Computational Perspectives on Infinite Groups, 1994

The complexity of greatest common divisor computations.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993
Graphs, Hypergraphs and Hashing.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992
An Optimal Algorithm for Generating Minimal Perfect Hash Functions.
Inf. Process. Lett., 1992

Algorithms for Groups.
Aust. Comput. J., 1992

Application of Computational Tools for Finitely Presented Groups.
Proceedings of the Computational Support for Discrete Mathematics, 1992

1991
Coset Enumeration Strategies.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990
A Nilpotent Quotient Algorithm for Graded Lie Rings.
J. Symb. Comput., 1990

1981
Hyperdisk, an access method for remote disk devices.
Aust. Comput. J., 1981

1979
Integer matrices and Abelian groups (invited).
Proceedings of the Symbolic and Algebraic Computation, 1979

1976
Collection.
Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, 1976


  Loading...