  Reed-Muller (RM) codes are one of the oldest families of codes. Recently, a
recursive projection aggregation (RPA) decoder has been proposed, which
achieves a performance that is close to the maximum likelihood decoder for
short-length RM codes. One of its main drawbacks, however, is the large amount
of computations needed. In this paper, we devise a new algorithm to lower the
computational budget while keeping a performance close to that of the RPA
decoder. The proposed approach consists of multiple sparse RPAs that are
generated by performing only a selection of projections in each sparsified
decoder. In the end, a cyclic redundancy check (CRC) is used to decide between
output codewords. Simulation results show that our proposed approach reduces
the RPA decoder's computations up to $80\%$ with negligible performance loss.
