The algorithm is described in the diploma thesis of Michael Brickenstein
"Neue Varianten zur Berechnung von Groebnerbasen",
written 2004 under supervision of G.-M. Greuel in Kaiserslautern.
It is designed to keep polynomials slim (short with small coefficients).
Currently best results are examples over function fields (parameters).
At this moment the implementation is not optimal for weighted degree orderings.
The program only supports the options
prot, which will give protocol output
redSB for returning a reduced Groebner basis.
The protocol messages of
slimgb mean the following:
M[n,m] means a parallel reduction of
n elements with
m non-zero output elements,
b notices an exchange trick described in the thesis and
e adds a reductor with non-minimal leading term.
For an example see slim Groebner bases.