Computing minimal associated primes in polynomial rings over the integers

An algorithm is presented to compute the minimal associated primes of an ideal in a polynomial ring over the integers. It differs from the known algorithms insofar as it avoids having to compute Gröbner bases over the integers until the very end, thereby eliminating one of the bottlenecks of those algorithms.