On Efficient Computation Of Grobner Bases