EDBT 2026 Demo / reviewers in the wild / expert
Andrea Sattler-Klein
dblp:65/2625
· DBLP profile ↗
13ranked-venue papers
8as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 13 · 8 first-authorArtificial intelligence and machine learning · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Logic in computer science · 50% Automated reasoning and model checking · 25% Computational complexity · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › term rewriting
completion |
0.0 | 1 | 1996 | Proof Lengths for Equational Completion · Inf. Comput. 1996 |
Automated reasoning and model checking
equational reasoning |
0.0 | 1 | 1996 | Proof Lengths for Equational Completion · Inf. Comput. 1996 |
Computational complexity › proof complexity
proof length |
0.0 | 1 | 1996 | Proof Lengths for Equational Completion · Inf. Comput. 1996 |
Logic in computer science
term rewriting |
0.0 | 1 | 1996 | Proof Lengths for Equational Completion · Inf. Comput. 1996 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Some complexity results for prefix Gröbner bases in free monoid rings
Andrea Sattler-Klein |
Theor. Comput. Sci. | 1 |
| 2007 | Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings
Andrea Sattler-Klein |
FCT | 1 |
| 2007 | An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings
Andrea Sattler-Klein |
STACS | 1 |
| 1998 | Automatic Monoids Versus Monoids with Finite Convergent Presentations
Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener |
RTA | 2 |
| 1997 | FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems
Friedrich Otto, Andrea Sattler-Klein |
FCT | 2 |
| 1997 | New Undecidablility Results for Finitely Presented Monoids
Andrea Sattler-Klein |
RTA | 1 |
| 1996 | Proof Lengths for Equational Completion
David A. Plaisted, Andrea Sattler-Klein |
Inf. Comput. | 2 |
| 1994 | About Changing the Ordering During Knuth-Bendix Completion
Andrea Sattler-Klein |
STACS | 1 |
| 1993 | On the Problem of Generating Small Convergent Systems
Klaus Madlener, Andrea Sattler-Klein, Friedrich Otto |
J. Symb. Comput. | 2 |
| 1992 | Generating Small Convergent Systems Can Be Extremely Hard
Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein |
ISAAC | 3 |
| 1992 | Infinite, Canonical String Rewriting Systems Generated by Completion
Andrea Sattler-Klein |
LPAR | 1 |
| 1991 | Divergence Phenomena during Completion
Andrea Sattler-Klein |
RTA | 1 |
| 1991 | Elimination of Composite Superpositions May Cause Abortion
Andrea Sattler-Klein |
J. Symb. Comput. | 1 |