---
title: "Bibliography"
canonical: "https://docs.magma-maths.org/FinitelyPresentedGroups/FPGroups/bibliography.html"
source: "https://docs.magma-maths.org/FinitelyPresentedGroups/FPGroups/bibliography.md"
part: "Finitely Presented Groups"
chapter: "Finitely Presented Groups"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "../../index.md"}
  - {"title": "Finitely Presented Groups", "source": "../index-finitely-presented-groups.md"}
  - {"title": "Finitely Presented Groups", "source": "index-fpgroups.md"}
prev: {"title": "Some Developed Examples", "source": "developed-examples.md"}
next: {"title": "Polycyclic Groups", "source": "../PolycyclicGroups/index-polycyclic-groups.md"}
---

# Bibliography

<a id="cite-extended-tc"></a>
- **[AR84]** D. G. Arrell and E. F. Robertson. A modified Todd-Coxeter algorithm. In *Computational group theory (Durham, 1982)*, pages 27–32. Academic Press, London, 1984.
<a id="cite-cdhw-todd-coxeter"></a>
- **[CDHW73]** John J. Cannon, Lucien A. Dimino, George Havas, and Jane M. Watson. Implementation and analysis of the Todd-Coxeter algorithm. *Math. Comp.*, 27:463–490, 1973.
<a id="cite-chn2011"></a>
- **[CHN11]** M. Conder, G. Havas, and M. Newman. On one-relator quotients of the modular group. In *Proc. Groups St Andrews 2009 in Bath*, number 387 in London Mathematical Society Lecture Note Series, 183–197. Cambridge University Press, 2011.
<a id="cite-af-thesis-09"></a>
- **[Fab09]** Anna Fabianska. *Algorithmic analysis of presentations of groups and modules*. Dissertation, RWTH Aachen University, 2009.
<a id="cite-havas-todd-coxeter"></a>
- **[Hav91]** G. Havas. Coset enumeration strategies. In *ISSAC'91*, 191–199. ACM Press, 1991.
<a id="cite-havhol2010"></a>
- **[HH10]** G. Havas and D.F. Holt. On Coxeter's families of group presentations. *J. Algebra*, 324(5):1076–1082, 2010.
<a id="cite-havas-tietze"></a>
- **[HKRR84]** George Havas, P. E. Kenne, J. S. Richardson, and E. F. Robertson. A Tietze transformation program. In *Computational group theory (Durham, 1982)*, pages 69–73. Academic Press, London, 1984.
<a id="cite-holt-handbook"></a>
- **[HEO05]** D. F. Holt, B. Eick, and E. O\`Brien. *Handbook of Computational Group Theory*. Chapman and Hall/CRC, 2005.
<a id="cite-jamborphd"></a>
- **[Jam12]** Sebastian Jambor. *An L3-U3-quotient algorithm for finitely presented groups*. PhD Thesis, RWTH Aachen University, 2012.
<a id="cite-jambor-l2quot"></a>
- **[Jam15]** Sebastian Jambor. An ${\rm L}_2$-quotient algorithm for finitely presented groups on arbitrarily many generators. *J. Algebra*, 423:1109–1142, 2015. URL: [https://doi.org/10.1016/j.jalgebra.2014.08.058](https://doi.org/10.1016/j.jalgebra.2014.08.058), [doi:10.1016/j.jalgebra.2014.08.058](https://doi.org/10.1016/j.jalgebra.2014.08.058).
<a id="cite-magnus-cgt"></a>
- **[MKS76]** Wilhelm Magnus, Abraham Karrass, and Donald Solitar. *Combinatorial group theory*. Dover Publications Inc., New York, revised edition, 1976. Presentations of groups in terms of generators and relations.
<a id="cite-newman-obrien"></a>
- **[NO96]** M. F. Newman and E. A. O'Brien. Application of computers to questions like those of Burnside. II. *Internat. J. Algebra Comput.*, 6(5):593–605, 1996.
<a id="cite-nickel-nq"></a>
- **[Nic96]** Werner Nickel. Computing nilpotent quotients of finitely presented groups. In *Geometric and computational perspectives on infinite groups (Minneapolis, MN and New Brunswick, NJ, 1994)*, pages 175–191. Amer. Math. Soc., Providence, RI, 1996.
<a id="cite-pf-09"></a>
- **[PF09]** W. Plesken and A. Fabianska. An L2-quotient algorithm for finitely presented groups. *J. Algebra*, 322(3):914–935, 2009.
<a id="cite-ace-homepage"></a>
- **[Ram]** Colin Ramsay. ACE. https://staff.itee.uq.edu.au/havas/.
<a id="cite-sims-fpgroups"></a>
- **[Sim94]** Charles C. Sims. *Computation with Finitely Presented Groups*. Cambridge University Press, Cambridge, 1994. ISBN 0-521-43213-8.