Speakers

• Andrey Nikolaev, Stevens Institute of Technology - Logspace and Compressed Word Computation in Finitely Generated Nilpotent Groups

• François Dahmani, Institut Fourier -On the Conjugacy Problem Between Some Automorphisms of Free Groups

• Bettina Eick, TU Braunschweig - The Classification of Nilpotent Groups of Hirsch Length at Most 5

• Jim Howie, Heriot-Watt University - 1-relator Quotients of Free Products

• Laura Ciobanu, University of Neuchâtel - Solving Equations in Free Groups

• Colva Roney-Dougal, University of St Andrews - Proving Hyperbolicity in Polynomial Time 

• Gili Golan, Vanderbilt University - The Generation Problem for Thompson Group F 

• Murray Elder, University of Newcastle - Random Walks and Amenability; Solving Equations in Free Groups

• Cameron Rogers, University of Newcastle - Computational Estimates of Folner sequences

• Peter Kropholler, University of Southampton - Finite Dimensional Representations of Automorphism Groups of Free Groups

• Armin Weiss, Stevens Institute of Technology - On the Dimension of Matrix Embeddings of Torsion-Freenilpotent Groups

• Mark Kambites, University of Manchester - Amenability of Finitely Generated Semigroups 

• Ian Leary, University of Southampton - Uncountably Many Groups of Type FP

• Susan Hermiller, University of Nebraska - Trees, Flow Functions, and Word Problems

• Alexei Miasnikov, Stevens Institute of Technology - What is the World We Live in? Mysteries of Computing

• John Cannon, University of Sydney - Computing Automatic Structures and Proving Finitely-Presented Groups to be Infinite

• Jack Button, University of Cambridge - A Wishlist of Routines for Finitely Presented Groups 

• George Havas, University of Queensland - Commutator Identities as Products of Powers 

• Funda Gul, Stevens Institute of Technology - Distortion of Embeddings of Tau-Groups into Group of Untriangular Matrices 

• Alexei Miasnikov, Stevens Institute of Technology - Non-Commutative Discrete Optimization and Groups 

• Robert Gilman, Stevens Institute of Technology - The Complexity of Coset Enumeration

• Jon McCammond, University of California - What We Know and Don't Know About Artin Groups 

• Sarah Rees, University of Newcastle - Rewriting in Artin Groups

• Tim Riley, Cornell University - Computing Area in Group Presentations