Andrea Sattler-Klein
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
6
Venues
4
Active years
1992–2007
Best venue rank
B
Where they publish
Papers
6 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2007 | FCT | Some Complexity Results for Prefix Grbner Bases in Free Monoid Rings. | Andrea Sattler-Klein |
| 2007 | STACS | An Exponential Lower Bound for Prefix Grbner Bases in Free Monoid Rings. | Andrea Sattler-Klein |
| 1997 | FCT | FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. | Friedrich Otto, Andrea Sattler-Klein |
| 1994 | STACS | About Changing the Ordering During Knuth-Bendix Completion. | Andrea Sattler-Klein |
| 1992 | ISAAC | Generating Small Convergent Systems Can Be Extremely Hard. | Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein |
| 1992 | LPAR | Infinite, Canonical String Rewriting Systems Generated by Completion. | Andrea Sattler-Klein |