The geobuckel data structure Is a suitable Intermediate representation of polynomials For performing large numbers of polynomial additions In the face of Interspersed leadterm extractions. A sum involving N term* has worst-case running time O(NlogN),matching or surpassing the performance of list* and binomial heaps. This makes the geobucket a good choice For performing reductions in Grobner basis computations.