Complexity of standard bases in projective dimension zero

This paper is the continuation of a previous one devoted to the complexity of standard bases in projective dimension zero (see Giusti, 1989). We improve the upper bound on the maximal degree of elements in a standard basis, with respect to any choice of coordinates and any compatible ordering, given in loc.cit. This bound is sharp, being attained for complete intersections and lexicographic ordering.