George Havas - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 40 from 40

2007

On the Efficiency of the Simple Groups of Order Less Than a Million and Their CoversColin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson. em, 16(3):347-358, 2007. [doi]

2005

4-Engel Groups are Locally NilpotentGeorge Havas, Michael R. Vaughan-Lee. ijac, 15(4):649-682, 2005. [doi]

2004

Experimenting with Infinite Groups, IGilbert Baumslag, Sean Cleary, George Havas. em, 13(4):495-502, 2004. [doi]

Nice Efficient Presentions for all Small Simple Groups and their CoversColin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson. lmsjcm, 7:266-283, 2004. [doi]

2003

Breadth-First Search and the Andrews-Curtis ConjectureGeorge Havas, Colin Ramsay. ijac, 13(1):61-68, 2003. [doi]

On the Complexity of the Extended Euclidean Algorithm (extended abstract)George Havas. ENTCS, 78:1-4, 2003. [doi]

Irreducible Cyclic Presentations of the Trivial GroupGeorge Havas, Edmund F. Robertson. em, 12(4):487-490, 2003. [doi]

1999

1998

1997

1996

A New Algorithm and Refined Bounds for Extended Gcd ComputationDavid Ford, George Havas. antsw 1996: 145-150

A Family of Perfect Hashing MethodsBohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech. cj, 39(6):547-554, 1996.

Distributed Algorithms for Depth-First SearchS. A. M. Makki, George Havas. ipl, 60(1):7-12, 1996. [doi]

1995

A Hard Problem That is Almost Always EasyGeorge Havas, Bohdan S. Majewski. isaac 1995: 216-223

A Solution to the Extended GCD ProblemBohdan S. Majewski, George Havas. issac 1995: 248-253 [doi]

1994

A New Problem in String SearchingGeorge Havas, Jin Xian Lian. isaac 1994: 660-668

Groups of deficiency zeroGeorge Havas, Mike F. Newman, Eamonn A. O'Brien. dimacs 1994: 53-68

The complexity of greatest common divisor computationsBohdan S. Majewski, George Havas. antsw 1994: 184-193

Distributed Algorithms for Constructing a Depth-First-Search TreeS. A. M. Makki, George Havas. icpp 1994: 270-273

1993

Graphs, Hypergraphs and HashingGeorge Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech. criwg 1994: 153-165

1992

Algorithms for GroupsJohn J. Cannon, George Havas. acj, 24(2):51-60, 1992.

An Optimal Algorithm for Generating Minimal Perfect Hash FunctionsZbigniew J. Czech, George Havas, Bohdan S. Majewski. ipl, 43(5):257-264, 1992.

Application of Computational Tools for Finitely Presented GroupsGeorge Havas, Edmund F. Robertson. dimacs 1994: 29-40

1991

Coset Enumeration StrategiesGeorge Havas. issac 1991: 191-199 [doi]

1990

A Nilpotent Quotient Algorithm for Graded Lie RingsGeorge Havas, M. F. Newman, Michael R. Vaughan-Lee. JSC, 9(5/6):653-664, 1990.

1981

Hyperdisk, an access method for remote disk devicesGeorge Havas. acj, 13(2):64-65, 1981.

1979

Integer matrices and Abelian groups (invited)George Havas, Leon Sterling. eurosam 1979: 431-451

1976

CollectionGeorge Havas, Tim Nicholson. issac 1976: 9-14 [doi]

Sign in or sign up to see more results.

runs on WebDSL