- Decision problems in finitely presented groups Derek F. Holt
- Groups and semigroups with a onecounter word Derek F. Holt,
- FINITE PRESENTATION OF FIBRE PRODUCTS OF METABELIAN GROUPS
- A computer-assisted analysis of some matrix Derek F. Holt and E.A. O'Brien
- London Mathematical Society ISSN 14611570 CONSTRUCTING MAXIMAL SUBGROUPS OF ORTHOGONAL
- Certain classical groups are not well-defined John N. Bray(1)
- Computing with abelian sections of finitely presented groups.
- Analyzing finitely presented groups by constructing representations
- STAR-FREE GEODESIC LANGUAGES FOR GROUPS SUSAN HERMILLER 1 , DEREK F. HOLT, AND SARAH REES
- Regularity of quasigeodesics in a hyperbolic group Derek F. Holt and Sarah Rees
- Solving the word problem in real time Derek F. Holt and Sarah Rees
- Testing matrix groups for primitivity Derek F. Holt, C.R. LeedhamGreen,
- Constructing a representation of the group (2; 3; 7; 11) D.F. Holt W. Plesken B. Souvignier
- Groups with indexed coword problem # Derek F. Holt and Claas E. Rover
- Representing quotients of permutation groups Derek F. Holt
- CERTAIN CYCLICALLY PRESENTED GROUPS ARE George Havas
- The transitive permutation groups of degree 32 John J. Cannon, Derek F. Holt
- Groups and semigroups with a one-counter word Derek F. Holt,
- Computing matrix group decompositions with respect to a normal subgroup
- Computation in wordhyperbolic groups David B. A. Epstein and Derek F. Holt
- Combing nilpotent and polycyclic groups Robert H. Gilman, Department of Mathematics,
- Isoperimetric inequalities for nilpotent groups S. M. Gersten, D. F. Holt and T. R. Riley
- Article Submitted to Journal of Symbolic Computation Automorphism group computation and
- Computing isometries of lattices W. Plesken B. Souvignier
- Automatic groups, subgroups and cosets Derek F. Holt
- Testing for isomorphism between finitely presented groups.
- The linearity of the conjugacy problem in word-hyperbolic groups
- Computing subgroups of bounded index in a nite John J. Cannon, Derek F. Holt, Michael Slattery and Allan K. Steel
- On real-time word problems Derek F. Holt and Claas E. Rover
- GROUPS WHOSE GEODESICS ARE LOCALLY SUSAN HERMILLER, DEREK F. HOLT, AND SARAH REES
- Comparing and combining tools for finitely presented George Havas, Derek F. Holt and Sarah Rees
- GROUPS WHOSE GEODESICS ARE LOCALLY SUSAN HERMILLER, DEREK F. HOLT, AND SARAH REES
- Submitted exclusively to the London Mathematical Society DOI: 10.1112/S0000000000000000
- Computing automorphism groups of finite Derek F. Holt
- Contemporary Mathematics Enumerating subgroups of the symmetric group
- The transitive permutation groups of degree 32 John J. Cannon, Derek F. Holt
- A CHARACTERISATION OF VIRTUALLY FREE GROUPS ROBERT H. GILMAN, SUSAN HERMILLER, DEREK F. HOLT, AND SARAH REES
- STAR-FREE GEODESIC LANGUAGES FOR GROUPS SUSAN HERMILLER1
- Submitted exclusively to the London Mathematical Society DOI: 10.1112/S0000000000000000
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- J. Symbolic Computation (1998) 11, 1--000 Computing automatic coset systems and subgroup
- On products of Sylow subgroups in finite groups D.F.Holt and P. Rowley
- Computing the subgroup lattice of a permutation group
- Groups that do and do not have growing context-sensitive word problem
- Computing a chief series and the soluble radical of a matrix group over a finite field
- The Meataxe as a tool in computational group theory
- Computing maximal subgroups of nite groups John J. Cannon and Derek F. Holt
- Submitted exclusively to the London Mathematical * DOI: 10.1112/S0000000000000000
- The transitive permutation groups of degree 32 John J. Cannon, Derek F. Holt
- Computing automorphism groups of finite groups
- The Meataxe as a tool in computational group theory
- Regularity of quasigeodesics in a hyperbolic group Derek F. Holt and Sarah Rees
- Decision problems in finitely presented groups Derek F. Holt
- Certain classical groups are not well-defined John N. Bray(1), Derek F. Holt(2)and Colva M. Roney-Dougal(3)*
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- On Coxeter's families of group presentations George Havasa,*,1, Derek F. Holtb
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- J. Symbolic Computation (1998) 11, 1-000 Computing automatic coset systems and subgroup
- Analyzing finitely presented groups by constructing representations
- Testing matrix groups for primitivity Derek F. Holt, C.R. Leedham-Green,
- A CHARACTERISATION OF VIRTUALLY FREE GROUPS ROBERT H. GILMAN, SUSAN HERMILLER, DEREK F. HOLT, AND SARAH REES
- Combing nilpotent and polycyclic groups Robert H. Gilman, Department of Mathematics,
- Representing the quotient groups of a finite permutation group
- Computing a chief series and the soluble radical of a matrix group over a finite field
- Representing the quotient groups of a finite permutation group
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- A cohomological criterion for a finitely presented group to be infinite
- An alternative proof that the Fibonacci group F (2; 9) is Derek F. Holt
- Efficient computation in wordhyperbolic David B. A. Epstein and Derek F. Holt
- Testing modules for irreducibility Derek F. Holt and Sarah Rees
- Recognizing badly presented Zmodules. George Havas \Lambda
- Groups and semigroups with a one-counter word problem
- Groups that do and do not have growing context-sensitive word problem
- Contemporary Mathematics Enumerating subgroups of the symmetric group
- Computing subgroups of bounded index in a finite group
- Computation in word-hyperbolic groups David B. A. Epstein and Derek F. Holt
- Testing modules for irreducibility Derek F. Holt and Sarah Rees
- Solving the word problem in real time Derek F. Holt and Sarah Rees
- A computer-assisted analysis of some matrix groups
- STAR-FREE GEODESIC LANGUAGES FOR GROUPS SUSAN HERMILLER1, DEREK F. HOLT, AND SARAH REES
- FINITE PRESENTATION OF FIBRE PRODUCTS OF METABELIAN GROUPS
- Testing for isomorphism between finitely presented groups.
- Computing the subgroup lattice of a permutation group
- An alternative proof that the Fibonacci group F (2, 9) is infinite.
- Automatic groups, subgroups and cosets Derek F. Holt
- Isoperimetric inequalities for nilpotent groups S. M. Gersten, D. F. Holt and T. R. Riley
- London Mathematical Society ISSN 146* CONSTRUCTING MAXIMAL SUBGROUPS OF ORTHOGONAL
- Computing with abelian sections of finitely presented groups.
- On products of Sylow subgroups in finite groups D.F.Holt and P. Rowley
- Computing subgroups of bounded index in a finite John J. Cannon, Derek F. Holt, Michael Slattery and Allan K. Steel
- Software for automatic groups, isomorphism testing and finitely presented groups.
- Computing maximal subgroups of finite groups John J. Cannon and Derek F. Holt
- Wordhyperbolic groups have realtime word Derek F. Holt
- On Coxeter's families of group presentations George Havasa,,1
- Recognizing badly presented Z -modules. George Havas * Derek F. Holt
- Computing matrix group decompositions with respect to a normal subgroup
- Representing quotients of permutation groups Derek F. Holt
- Constructing a representation of the group (2, 3, 7; 11) D.F. Holt W. Plesken B. Souvignier
- Word-hyperbolic groups have real-time word problem
- CERTAIN CYCLICALLY PRESENTED GROUPS ARE INFINITE
- GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE
- Computing isometries of lattices W. Plesken B. Souvignier
- Computing maximal subgroups of finite groups John J. Cannon and Derek F. Holt
- On real-time word problems Derek F. Holt and Claas E. R"over*
- Comparing and combining tools for finitely presented groups
- Efficient computation in word-hyperbolic groups
- A cohomological criterion for a finitely presented group to be infinite
- Article Submitted to Journal of Symbolic Computation Automorphism group computation and
- Software for automatic groups, isomorphism testing and finitely presented groups.
- Computing a chief series and the soluble radical of a matrix group over a finite field