For information on the authors, as far as they belong to the working
group, see the list of current and former staff.
Andrea Sattler-Klein.
Some Complexity
Results for Prefix Gröbner Bases in Free Monoid Rings.
In
FCT, volume 4639 of
Lecture Notes in Computer Science,
pages 470-481. Springer, 2007.
Andrea Sattler-Klein.
An Exponential
Lower Bound for Prefix Gröbner Bases in Free Monoid Rings.
In
STACS, volume 4393 of
Lecture Notes in Computer Science,
pages 308-319. Springer, 2007.
Anne Bläsius, Michael Geilke, Stefan Schweickert, Richard
Städtler, and Laura Zilles.
Computer algebra project: Lambda-confluent prefix string rewriting system by
pushdown automaton.
, TU Kaiserslautern, 11 2007.
