default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Sattler-Klein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j5]Andrea Sattler-Klein:
Some complexity results for prefix Gröbner bases in free monoid rings. Theor. Comput. Sci. 411(4-5): 823-833 (2010)
2000 – 2009
- 2007
- [c9]Andrea Sattler-Klein:
Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings. FCT 2007: 470-481 - [c8]Andrea Sattler-Klein:
An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings. STACS 2007: 308-319 - 2000
- [j4]Friedrich Otto, Andrea Sattler-Klein:
The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems. Int. J. Algebra Comput. 10(3): 285-308 (2000)
1990 – 1999
- 1998
- [c7]Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener:
Automatic Monoids Versus Monoids with Finite Convergent Presentations. RTA 1998: 32-46 - 1997
- [c6]Friedrich Otto, Andrea Sattler-Klein:
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. FCT 1997: 388-399 - [c5]Andrea Sattler-Klein:
New Undecidablility Results for Finitely Presented Monoids. RTA 1997: 68-82 - 1996
- [b1]Andrea Sattler-Klein:
A systematic study of infinite canonical systems generated by Knuth-Bendix completion and related problems. Universität Kaiserslautern, 1996, pp. 1-344 - [j3]David A. Plaisted, Andrea Sattler-Klein:
Proof Lengths for Equational Completion. Inf. Comput. 125(2): 154-170 (1996) - [p1]Andrea Sattler-Klein:
Phänomene der Knuth-Bendix Vervollständigung. Ausgezeichnete Informatikdissertationen 1996: 95-113 - 1994
- [c4]Andrea Sattler-Klein:
About Changing the Ordering During Knuth-Bendix Completion. STACS 1994: 175-186 - 1993
- [j2]Klaus Madlener, Andrea Sattler-Klein, Friedrich Otto:
On the Problem of Generating Small Convergent Systems. J. Symb. Comput. 16(2): 167-187 (1993) - 1992
- [c3]Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein:
Generating Small Convergent Systems Can Be Extremely Hard. ISAAC 1992: 299-308 - [c2]Andrea Sattler-Klein:
Infinite, Canonical String Rewriting Systems Generated by Completion. LPAR 1992: 433-444 - 1991
- [j1]Andrea Sattler-Klein:
Elimination of Composite Superpositions May Cause Abortion. J. Symb. Comput. 11(3): 205-211 (1991) - [c1]Andrea Sattler-Klein:
Divergence Phenomena during Completion. RTA 1991: 374-385
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
