The paper introduce the zero communication model of computation, describes tight bounds for matroids and matchings in this model, and shows how they yield faster parameterized deterministic parallel algorithms to these problems.