The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrea Sattler-Klein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Andrea Sattler-Klein
    Infinite, Canonical String Rewriting Systems Generated by Completion. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:433-444 [Conf]
  4. 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]
  5. Andrea Sattler-Klein
    Divergence Phenomena during Completion. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:374-385 [Conf]
  6. Andrea Sattler-Klein
    New Undecidablility Results for Finitely Presented Monoids. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:68-82 [Conf]
  7. Andrea Sattler-Klein
    About Changing the Ordering During Knuth-Bendix Completion. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:175-186 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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.012secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002