Andrea Sattler-Klein

According to our database, Andrea Sattler-Klein authored at least 15 papers between 1991 and 2010.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2010

Some complexity results for prefix Gröbner bases in free monoid rings.

Andrea Sattler-Klein

Theor. Comput. Sci., 2010

2007

An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings.

Andrea Sattler-Klein

Proceedings of the STACS 2007, 2007

2000

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

1998

Automatic Monoids Versus Monoids with Finite Convergent Presentations.

Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

1997

New Undecidablility Results for Finitely Presented Monoids.

Andrea Sattler-Klein

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems.

Friedrich Otto, Andrea Sattler-Klein

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996

Proof Lengths for Equational Completion.

David A. Plaisted, Andrea Sattler-Klein

Inf. Comput., 1996

Phänomene der Knuth-Bendix Vervollständigung.

Andrea Sattler-Klein

Proceedings of the Ausgezeichnete Informatikdissertationen 1996, 1996

A systematic study of infinite canonical systems generated by Knuth-Bendix completion and related problems.

Andrea Sattler-Klein

PhD thesis, 1996

1994

About Changing the Ordering During Knuth-Bendix Completion.

Andrea Sattler-Klein

Proceedings of the STACS 94, 1994

1993

On the Problem of Generating Small Convergent Systems.

Klaus Madlener, Andrea Sattler-Klein, Friedrich Otto

J. Symb. Comput., 1993

1992

Infinite, Canonical String Rewriting Systems Generated by Completion.

Andrea Sattler-Klein

Proceedings of the Logic Programming and Automated Reasoning, 1992

Generating Small Convergent Systems Can Be Extremely Hard.

Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Elimination of Composite Superpositions May Cause Abortion.

Andrea Sattler-Klein

J. Symb. Comput., 1991

Divergence Phenomena during Completion.

Andrea Sattler-Klein

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991