The speakers of this workshop include:

• Oleg Bogopolski (Düsseldorf)
  An algorithm for computing a basis of the fixed point subgroup of an automorphism of a free group
• Tara Brough (St Andrews)
  Free products and wreath products of automaton semigroups
• Jack Button (Cambridge)
  Detecting largeness of finitely presented groups
• Ahmed Sinan Cevik (Konya)
  A new approach to connect algebra with analysis: relationships and applications between presentations and generating functions
• Laura Ciobanu (Neuchatel)
  Geodesic growth in some Artin and Coxeter groups
• Alla Detinko (Galway)
  Computing with linear groups of finite rank
• Andreas Distler (Braunschweig)
  An algorithm for the classification of nilpotent semigroups by coclass
• Andrew Duncan (Newcastle)
  Folding and subgroup membership in amalgams of free groups
• Bob Gilman (New York)
  New applications of formal language theory to group theory
• Derek Holt (Warwick)
  Computing automorphism groups and testing groups for isomorphism
• Max Horn (Gießen)
  Solvable group generation
• Jim Howie (Edinburgh)
  Lengths of conjugators
• Sebastian Jambor (Auckland)
  An L_3-U_3-quotient algorithm for finitely presented groups
• Eylem Güzel Karpuz (Karaman)
  Gröbner-Shirshov Bases and Word Problem for Some Monoid Constructions
• Benjamin Klopsch (Magdeburg)
  Enumeration of ideals in soluble Lie lattices
• Alexander Konovalov (St Andrews)
  Practical approach to partial augmentations: torsion units in integral group rings of finite groups
• Martin Kreuzer (Passau)
  Efficient Groebner basis computation in group rings and applications
• Markus Lohrey (Leipzig)
  The compressed word problem for wreath products
• Alexei Miasnikov (New York)
  Using automata to solve algorithmic problems in relatively hyperbolic groups
• Matthias Neumann-Brosig (Braunschweig)
  On the hyperbolicity of strict Pride-groups
• Markus Pfeiffer (St Andrews)
  The Polyrational Hierarchy
• Sarah Rees (Newcastle)
  Algebraic models of computation
• Colva Roney-Dougal (St Andrews)
  A new approach to computation in finitely-presented groups
• Tobias Rossmann (Bielefeld)
  Computing zeta functions of groups and rings
• Saul Schleimer (Warwick)
  A polynomial-time algorithm for the compressed word problem in Gromov hyperbolic groups
• Vladimir Shpilrain (New York)
  Recent advances in group-based cryptography
• Ben Steinberg (New York)
  Rational subsets and submonoids of groups: noncommutative integer programming
• Richard Weidmann (Kiel)
  Nielsen equivalence in small cancellation groups
• Armin Weiß (Stuttgart)
  Context-Free Groups and Their Structure Trees