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