We propose an improvement upon the standard algorithm for computing the kernel of a polynomial map, assuming that the map sendsmonomials into monomials. Rather than computing a Gräbner basis in the joint polynomial ring, and then selecting only the elements of interest, we show that a moderate number of iterations of the Buchberger algorithm in the variables of the domain suffices.