What are interesting algorithmic questions for groups in table representation?
First, is it a group at all?  A fundamental problem is checking whether a given operation (in table form) is associative.  The obvious approach is cubic time, Rajagopalan and Schulman do it in near-quadratic time.