1. Joan S. Birman, Volker Gebhardt, and Juan González-Meneses, Conjugacy in Garside groups. III. Periodic braids, J. Algebra 316 (2007), no. 2, 746–776.[MR]
  2. Volker Gebhardt, Constructing a short defining set of relations for a finite group, J. Algebra 233 (2000), no. 2, 526–542.[MR]
  3. Volker Gebhardt, Two short presentations for Lyons' sporadic simple group, Experiment. Math. 9 (2000), no. 3, 333–338.[MR]
  4. Volker Gebhardt, Efficient collection in infinite polycyclic groups, J. Symbolic Comput. 34 (2002), no. 3, 213–228.[MR]
  5. Volker Gebhardt, A new approach to the conjugacy problem in Garside groups, J. Algebra 292 (2005), no. 1, 282–302.[MR]
  6. Volker Gebhardt, Computer aided discovery of a fast algorithm for testing conjugacy in braid groups, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 261–285.[MR]
  7. Volker Gebhardt, Conjugacy search in braid groups: From a braid-based cryptography point of view, Appl. Algebra Engrg. Comm. Comput. 17 (2006), no. 3-4, 219–238.[MR]