Dear all, Let k be a finite field and G a finite group. Does anyone know of an efficient algorithm for computing all indecomposable kG-modules up to a given rank? (Note that since k is finite there are only finitely many of these). Even better, does anyone know of an implementation of such an algorithm? best wishes, Kasper Andersen