| 2005 |
|---|
| 30 | EE | George Havas,
Michael R. Vaughan-Lee:
4-Engel Groups are Locally Nilpotent.
IJAC 15(4): 649-682 (2005) |
| 2003 |
|---|
| 29 | EE | George Havas:
On the Complexity of the Extended Euclidean Algorithm (extended abstract).
Electr. Notes Theor. Comput. Sci. 78: (2003) |
| 28 | EE | George Havas,
Colin Ramsay:
Breadth-First Search and the Andrews-Curtis Conjecture.
IJAC 13(1): 61-68 (2003) |
| 1999 |
|---|
| 27 | EE | Gene Cooperman,
Sandra Feisel,
Joachim von zur Gathen,
George Havas:
GCD of Many Integers.
COCOON 1999: 310-317 |
| 26 | EE | Jin-yi Cai,
George Havas,
Bernard Mans,
Ajay Nerurkar,
Jean-Pierre Seifert,
Igor Shparlinski:
On Routing in Circulant Graphs.
COCOON 1999: 360-369 |
| 25 | | George Havas,
Jean-Pierre Seifert:
The Complexity of the Extended GCD Problem.
MFCS 1999: 103-113 |
| 24 | EE | 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): 551-557 (1999) |
| 1998 |
|---|
| 23 | | Weifa Liang,
George Havas:
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3.
CATS 1998: 37-50 |
| 22 | EE | Weifa Liang,
George Havas,
Xiaojun Shen:
Improved Lightpath (Wavelength) Routing in Large WDM Networks.
ICDCS 1998: 516-523 |
| 21 | | George Havas,
Clemens Wagner:
Some Performance Studies in Exact Linear Algebra.
Wide Area Networks and High Performance Computing 1998: 161-170 |
| 1997 |
|---|
| 20 | | Weifa Liang,
George Havas:
NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph.
Euro-Par 1997: 430-439 |
| 19 | | Xin Gui Fang,
George Havas:
On the Worst-case Complexity of Integer Gaussian Elimination.
ISSAC 1997: 28-31 |
| 18 | | S. A. M. Makki,
George Havas:
An Efficient Method for Constructing a Distributed Depth-First Search Tree.
PDPTA 1997: 660-666 |
| 17 | | George Havas:
Bohdan S. Majewski: Integer Matrix Diagonalization.
J. Symb. Comput. 24(3/4): 399-408 (1997) |
| 16 | EE | Zbigniew J. Czech,
George Havas,
Bohdan S. Majewski:
Perfect Hashing.
Theor. Comput. Sci. 182(1-2): 1-143 (1997) |
| 1996 |
|---|
| 15 | | David Ford,
George Havas:
A New Algorithm and Refined Bounds for Extended Gcd Computation.
ANTS 1996: 145-150 |
| 14 | | Bohdan S. Majewski,
Nicholas C. Wormald,
George Havas,
Zbigniew J. Czech:
A Family of Perfect Hashing Methods.
Comput. J. 39(6): 547-554 (1996) |
| 13 | EE | S. A. M. Makki,
George Havas:
Distributed Algorithms for Depth-First Search.
Inf. Process. Lett. 60(1): 7-12 (1996) |
| 1995 |
|---|
| 12 | | George Havas,
Bohdan S. Majewski:
A Hard Problem That is Almost Always Easy.
ISAAC 1995: 216-223 |
| 11 | EE | Bohdan S. Majewski,
George Havas:
A Solution to the Extended GCD Problem.
ISSAC 1995: 248-253 |
| 1994 |
|---|
| 10 | | Bohdan S. Majewski,
George Havas:
The complexity of greatest common divisor computations.
ANTS 1994: 184-193 |
| 9 | | S. A. M. Makki,
George Havas:
Distributed Algorithms for Constructing a Depth-First-Search Tree.
ICPP (3) 1994: 270-273 |
| 8 | | George Havas,
Jin Xian Lian:
A New Problem in String Searching.
ISAAC 1994: 660-668 |
| 1993 |
|---|
| 7 | | George Havas,
Bohdan S. Majewski,
Nicholas C. Wormald,
Zbigniew J. Czech:
Graphs, Hypergraphs and Hashing.
WG 1993: 153-165 |
| 1992 |
|---|
| 6 | | John J. Cannon,
George Havas:
Algorithms for Groups.
Australian Computer Journal 24(2): 51-60 (1992) |
| 5 | | Zbigniew J. Czech,
George Havas,
Bohdan S. Majewski:
An Optimal Algorithm for Generating Minimal Perfect Hash Functions.
Inf. Process. Lett. 43(5): 257-264 (1992) |
| 1991 |
|---|
| 4 | EE | George Havas:
Coset Enumeration Strategies.
ISSAC 1991: 191-199 |
| 1990 |
|---|
| 3 | | George Havas,
M. F. Newman,
Michael R. Vaughan-Lee:
A Nilpotent Quotient Algorithm for Graded Lie Rings.
J. Symb. Comput. 9(5/6): 653-664 (1990) |
| 1981 |
|---|
| 2 | | George Havas:
Hyperdisk, an access method for remote disk devices.
Australian Computer Journal 13(2): 64-65 (1981) |
| 1979 |
|---|
| 1 | | George Havas,
Leon Sterling:
Integer matrices and Abelian groups (invited).
EUROSAM 1979: 431-451 |
