Even after 25 years the article by Joachim Neubiiser remains the first source to which all three of us refer those who want to find out about the use of coset tables for studying groups. Our view is confirmed by the 14 Reference Citations from 1998 to 2005 which MathSciNet reveals for this article. Here we loosely follow the structure of the original article and provide some updates on the area (oriented towards our own interests).
First we point out that two newer books include comprehensive details on coset enumeration and related topics in works which are much broader studies. They give excellent coverage of the areas addressed in this article and, further, provide much additional material. They also provide some alternative points of view and many references (as do the other materials cited here).
One of Neubüser's aims in writing his survey was to provide a unified view on coset table methods in computational group theory. He addressed the way coset table concepts were developed, implemented and used. In Derek Holt follows the same kind of approach, including a long chapter “Coset Enumeration” and a shorter one “Presentations for Given Groups”. Charles Sims in focuses on finitely presented groups and he takes a perspective significantly based on some fundamental methods from theoretical computer science, namely automata theory and formal languages.