On parallel computation of Groebner bases
Anton Leykin (Mathematics, University of Minnesota)
In this talk we describe a parallel algorithm for computing Groebner bases. The proposed method shows significant speedups, especially for computations in a noncommutative setting, e.g. Weyl algebras.