12 citations · 17 across the 7 of their papers we have counts for
7 papers
Giesbrecht's algorithm, the HFE cryptosystem and Ore's -polynomials
Robert S. Coulter, George Havas, Marie Henderson
We report on a recent implementation of Giesbrecht's algorithm for factoring polynomials in a skew-polynomial ring. We also discuss the equivalence between factoring polynomials in…
Applications of computational tools for finitely presented groups
George Havas, Edmund F. Robertson
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone progra…
A new problem in string searching
George Havas, Jin Xian Lian
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest…
Recognizing badly presented Z-modules
George Havas, Derek F. Holt, Sarah Rees
Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomp…
Applications of substring searching to group presentations
George Havas, Mark Ollila
An important way for describing groups is by finite presentations. Large presentations arise in practice which are poorly suited for either human or computer use. Presentation simp…
Algorithms for groups
John Cannon, George Havas
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide ap…