We propose a new algorithm for the computation of the minimal associated primes of an ideal. In [1] we have introduced modifications to an algorithm for the computation of the radical by Krick and Logar ([2]) (based on ideas by Gianni, Trager and Zacharias ([3])), that made it more efficient. In this work, we show how these same modifications can be applied… (More)