1. Hans Ulrich Besche and Bettina Eick, The groups of order at most 1000 except 512 and 768, J. Symbolic Comput. 27 (1999), no. 4, 405–413.[MR]
  2. Hans Ulrich Besche, Bettina Eick, and E. A. O'Brien, The groups of order at most 2000, Electron. Res. Announc. Amer. Math. Soc. 7 (2001), 1–4 (electronic).[MR]
  3. Hans Ulrich Besche, Bettina Eick, and E. A. O'Brien, A millennium project: Constructing small groups, Internat. J. Algebra Comput. 12 (2002), no. 5, 623–644.[MR]
  4. Dietrich Burde, Bettina Eick, and Willem de Graaf, Computing faithful representations for nilpotent Lie algebras, J. Algebra 322 (2009), no. 3, 602–612.[MR/doi]
  5. John J. Cannon, Bettina Eick, and Charles R. Leedham-Green, Special polycyclic generating sequences for finite soluble groups, J. Symbolic Comput. 38 (2004), no. 5, 1445–1460.[MR]
  6. Bettina Eick, Computational group theory, Jahresber. Deutsch. Math.-Verein. 107 (2005), no. 3, 155–170.[MR/link]
  7. Bettina Eick and Delaram Kahrobaei, Polycyclic groups: a new platform for cryptology?, preprint (2004), 47 pages.[arXiv]
  8. Bettina Eick, C. R. Leedham-Green, and E. A. O'Brien, Constructing automorphism groups of p-groups, Comm. Algebra 30 (2002), no. 5, 2271–2295.[MR]
  9. Bettina Eick, M. F. Newman, and E. A. O'Brien, The class-breadth conjecture revisited, J. Algebra 300 (2006), no. 1, 384–393.[MR]
  10. Bettina Eick and E. A. O'Brien, Enumerating p-groups, J. Austral. Math. Soc. Ser. A 67 (1999), no. 2, 191–205.[MR]
  11. Bettina Eick and Bernd Souvignier, Algorithms for crystallographic groups, Int. J. Quantum. Chem 106 (2006), no. 1, 316–343.
  12. Derek F. Holt, Bettina Eick, and Eamonn A. O'Brien, Handbook of Computational Group Theory, Discrete Mathematics and its Applications (Boca Raton), Chapman &Hall/CRC, Boca Raton, FL, 2005, pp. xvi+514.[MR]