Divergence Phenomena during Completion. - Andrea Sattler-Klein (RTA, 1991)

Elimination of Composite Superpositions May Cause Abortion. - Andrea Sattler-Klein (J. Symb. Comput., 1991)

Generating Small Convergent Systems Can Be Extremely Hard. - Klaus Madlener; Friedrich Otto; Andrea Sattler-Klein (ISAAC, 1992)

Infinite, Canonical String Rewriting Systems Generated by Completion. - Andrea Sattler-Klein (LPAR, 1992)

On the Problem of Generating Small Convergent Systems. - Klaus Madlener; Andrea Sattler-Klein; Friedrich Otto (J. Symb. Comput., 1993)

About Changing the Ordering During Knuth-Bendix Completion. - Andrea Sattler-Klein (STACS, 1994)

A systematic study of infinite canonical systems generated by Knuth-Bendix completion and related problems. - Andrea Sattler-Klein (1996)

Phänomene der Knuth-Bendix Vervollständigung. - Andrea Sattler-Klein (Ausgezeichnete Informatikdissertationen, 1996)

Proof Lengths for Equational Completion. - David A. Plaisted; Andrea Sattler-Klein (Inf. Comput., 1996)

FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. - Friedrich Otto; Andrea Sattler-Klein (FCT, 1997)

New Undecidablility Results for Finitely Presented Monoids. - Andrea Sattler-Klein (RTA, 1997)

Automatic Monoids Versus Monoids with Finite Convergent Presentations. - Friedrich Otto; Andrea Sattler-Klein; Klaus Madlener (RTA, 1998)

The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems. - Friedrich Otto; Andrea Sattler-Klein (Int. J. Algebra Comput., 2000)

An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings. - Andrea Sattler-Klein (STACS, 2007)

Some complexity results for prefix Gröbner bases in free monoid rings. - Andrea Sattler-Klein (Theor. Comput. Sci., 2010)