Complexity of comparing monomials and two improvements of the   BM-algorithm
  We give a new algorithm for merging sorted lists of monomials. Together with a projection technique we obtain a new complexity bound for the BM-algorithm. 
Samuel Lundqvist