An LLT-type algorithm for computing higher-level canonical bases

We give a fast algorithm for computing the canonical basis of an irreducible highest-weight module for $U_q({\widehat{\mathfrak{s}\mathfrak{l}}}_e)$, generalising the LLT algorithm.