 | 2007 |
|---|
| 13 |       | Andrea Sattler-Klein:
Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings.
FCT 2007: 470-481 |
| 12 | | Andrea Sattler-Klein:
An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings.
STACS 2007: 308-319 |
| 2000 |
|---|
| 11 | | Friedrich Otto,
Andrea Sattler-Klein:
The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems.
IJAC 10(3): 285-308 (2000) |
| 1998 |
|---|
| 10 | | Friedrich Otto,
Andrea Sattler-Klein,
Klaus Madlener:
Automatic Monoids Versus Monoids with Finite Convergent Presentations.
RTA 1998: 32-46 |
| 1997 |
|---|
| 9 |  | Friedrich Otto,
Andrea Sattler-Klein:
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems.
FCT 1997: 388-399 |
| 8 | | Andrea Sattler-Klein:
New Undecidablility Results for Finitely Presented Monoids.
RTA 1997: 68-82 |
| 1996 |
|---|
| 7 | | David A. Plaisted,
Andrea Sattler-Klein:
Proof Lengths for Equational Completion.
Inf. Comput. 125(2): 154-170 (1996) |
| 1994 |
|---|
| 6 | | Andrea Sattler-Klein:
About Changing the Ordering During Knuth-Bendix Completion.
STACS 1994: 175-186 |
| 1993 |
|---|
| 5 | | Klaus Madlener,
Andrea Sattler-Klein,
Friedrich Otto:
On the Problem of Generating Small Convergent Systems.
J. Symb. Comput. 16(2): 167-187 (1993) |
| 1992 |
|---|
| 4 | | Klaus Madlener,
Friedrich Otto,
Andrea Sattler-Klein:
Generating Small Convergent Systems Can Be Extremely Hard.
ISAAC 1992: 299-308 |
| 3 | | Andrea Sattler-Klein:
Infinite, Canonical String Rewriting Systems Generated by Completion.
LPAR 1992: 433-444 |
| 1991 |
|---|
| 2 | | Andrea Sattler-Klein:
Divergence Phenomena during Completion.
RTA 1991: 374-385 |
| 1 | | Andrea Sattler-Klein:
Elimination of Composite Superpositions May Cause Abortion.
J. Symb. Comput. 11(3): 205-211 (1991) |
