Professor Sarah Rees
| Automaticity for graphs of groups | 2021 |
|
Professor Sarah Rees
| Equations in groups that are virtually direct products | 2020 |
|
Professor Sarah Rees
| Multifraction reduction IV: Padding and Artin-Tits monoids of sufficiently large type | 2018 |
|
Professor Sarah Rees
| The generalised word problem in hyperbolic and relatively hyperbolic groups | 2018 |
|
Professor Sarah Rees
| Groups, languages and automata | 2017 |
|
Professor Sarah Rees
| Some closure results for C-approximable groups | 2017 |
|
Professor Sarah Rees
| A method for building permutation representations of finitely presented groups | 2016 |
|
Professor Sarah Rees
| Conjugacy languages in groups | 2016 |
|
Professor Sarah Rees
| Rapid decay and Baum-Connes for large type Artin groups | 2016 |
|
Professor Sarah Rees
| Rewriting systems in sufficiently large Artin-Tits groups | 2016 |
|
Professor Sarah Rees
| Conjugacy in Artin groups of extra-large type | 2015 |
|
Professor Sarah Rees
| David Rees 1918-2013 | 2014 |
|
Professor Sarah Rees
| Sofic groups: graph products and graphs of groups | 2014 |
|
Professor Sarah Rees
| Rapid decay is preserved by graph products | 2013 |
|
Professor Sarah Rees
| Shortlex automaticity and geodesic regularity in Artin groups | 2013 |
|
Professor Sarah Rees
| Artin groups of large type are shortlex automatic with regular geodesics | 2012 |
|
Professor Sarah Rees
| Generalising some results about right-angled Artin groups to graph products of groups | 2012 |
|
Professor Sarah Rees
Dr Claas Roever
| Groups with context-free conjugacy problems | 2011 |
|
Dr Michael Batty
Dr Andrew Duncan
Professor Sarah Rees
| An application of the Deutsch-Jozsa algorithm to formal languages and the word problem in groups | 2008 |
|
Professor Sarah Rees
| Groups that do and do not have growing context-sensitive wordproblem | 2008 |
|
Professor Sarah Rees
| Groups whose geodesics are locally testable | 2008 |
|
Professor Sarah Rees
| The automata that define representations of monomial algebras | 2008 |
|
Professor Sarah Rees
| A characterisation of virtually free groups | 2007 |
|
Professor Sarah Rees
| Star-free geodesic languages for groups | 2007 |
|
Oliver Payne
Professor Sarah Rees
| Computing subgroup presentations, using the coherence arguments of McCammond and Wise | 2006 |
|
Professor Sarah Rees
| Groups with context-free co-word problem | 2005 |
|
Dr Michael Batty
Dr Andrew Duncan
Professor Sarah Rees
| Quantum Algorithms in Group Theory | 2004 |
|
Dr Michael Batty
Dr Andrew Duncan
Professor Sarah Rees
| Quantum algorithms in group theory | 2004 |
|
Dr Michael Batty
Dr Andrew Duncan
Professor Sarah Rees
| Quantum algorithms in group theory | 2003 |
|
Professor Sarah Rees
| Regularity of quasigeodesics in a hyperbolic group | 2003 |
|
Professor Sarah Rees
| Regularity of Quasigeodesics in a hyperbolic group | 2003 |
|
Professor Sarah Rees
| How hard is the word problem | 2002 |
|
Professor Sarah Rees
| Solving the word problem in real time | 2001 |
|
Professor Sarah Rees
| An Algorithmic Approach to Fundamental Groups and Covers of Combinatorial Cell Complexes | 2000 |
|
Professor Sarah Rees
| A language theoretic analysis of combings | 1999 |
|
Professor Sarah Rees
| Combing nilpotent and polycyclic groups | 1999 |
|
Professor Sarah Rees
| Computing with Abelian sections of finitely presented groups | 1999 |
|
Professor Sarah Rees
| Computing with abelian sections of finitely presentedgroups | 1999 |
|
Professor Sarah Rees
| Some challenging group presentations | 1999 |
|
Professor Sarah Rees
| Some challenging group presentations | 1999 |
|
Professor Sarah Rees
| Some challenging group presentations | 1999 |
|
