Klaus Madlener

From MaRDI portal
(Redirected from Person:580493)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
scientific article; zbMATH DE number 1860714 (Why is no real title available?)2003-05-22Paper
Some applications of prefix-rewriting in monoids, groups, and rings2002-02-13Paper
scientific article; zbMATH DE number 1563438 (Why is no real title available?)2001-11-06Paper
scientific article; zbMATH DE number 1163436 (Why is no real title available?)1999-11-02Paper
scientific article; zbMATH DE number 1241626 (Why is no real title available?)1999-10-26Paper
scientific article; zbMATH DE number 1262445 (Why is no real title available?)1999-10-11Paper
scientific article; zbMATH DE number 1263328 (Why is no real title available?)1999-10-11Paper
scientific article; zbMATH DE number 1263366 (Why is no real title available?)1999-09-08Paper
scientific article; zbMATH DE number 1302503 (Why is no real title available?)1999-08-31Paper
scientific article; zbMATH DE number 1189057 (Why is no real title available?)1999-06-20Paper
scientific article; zbMATH DE number 1301092 (Why is no real title available?)1999-06-15Paper
A generalization of Gröbner basis algorithms to polycyclic group rings
Journal of Symbolic Computation
1999-02-15Paper
Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
Theoretical Computer Science
1999-01-12Paper
scientific article; zbMATH DE number 1051238 (Why is no real title available?)1998-06-01Paper
A generalization of Gröbner basis algorithms to nilpotent group rings
Applicable Algebra in Engineering, Communication and Computing
1997-11-27Paper
scientific article; zbMATH DE number 1008505 (Why is no real title available?)1997-08-07Paper
scientific article; zbMATH DE number 671957 (Why is no real title available?)1995-08-27Paper
Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups
Mathematical Logic Quarterly
1994-11-24Paper
On the problem of generating small convergent systems
Journal of Symbolic Computation
1994-08-31Paper
Computing presentations for subgroups of polycyclic groups and of context-free groups
Applicable Algebra in Engineering, Communication and Computing
1994-08-29Paper
On weakly confluent monadic string-rewriting systems
Theoretical Computer Science
1994-01-09Paper
scientific article; zbMATH DE number 176741 (Why is no real title available?)1993-05-18Paper
scientific article; zbMATH DE number 176502 (Why is no real title available?)1993-05-18Paper
scientific article; zbMATH DE number 4155899 (Why is no real title available?)1990-01-01Paper
About the descriptive power of certain classes of finite string-rewriting systems
Theoretical Computer Science
1989-01-01Paper
scientific article; zbMATH DE number 4132298 (Why is no real title available?)1989-01-01Paper
Pseudo-natural algorithms for finitely generated presentations of monoids and groups
Journal of Symbolic Computation
1988-01-01Paper
Commutativity in groups presented by finite Church-Rosser Thue systems
RAIRO - Theoretical Informatics and Applications
1988-01-01Paper
scientific article; zbMATH DE number 4099552 (Why is no real title available?)1988-01-01Paper
Using string-rewriting for solving the word problem for finitely presented groups
Information Processing Letters
1987-01-01Paper
scientific article; zbMATH DE number 4036065 (Why is no real title available?)1987-01-01Paper
Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems1986-01-01Paper
scientific article; zbMATH DE number 3983496 (Why is no real title available?)1986-01-01Paper
Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
Journal of Symbolic Computation
1985-01-01Paper
scientific article; zbMATH DE number 3993567 (Why is no real title available?)1985-01-01Paper
On the complexity of intersection and conjugacy problems in free groups
Theoretical Computer Science
1984-01-01Paper
The Nielsen reduction and P-complete problems in free groups
Theoretical Computer Science
1984-01-01Paper
scientific article; zbMATH DE number 3751254 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3874607 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3716780 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3777739 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3731337 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3811849 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3670452 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3643248 (Why is no real title available?)1979-01-01Paper
Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen
Acta Informatica
1978-01-01Paper
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität
Archiv für Mathematische Logik und Grundlagenforschung
1978-01-01Paper
scientific article; zbMATH DE number 3559555 (Why is no real title available?)1977-01-01Paper
Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität
Acta Informatica
1977-01-01Paper
scientific article; zbMATH DE number 3565223 (Why is no real title available?)1977-01-01Paper
scientific article; zbMATH DE number 3490965 (Why is no real title available?)1975-01-01Paper
scientific article; zbMATH DE number 3491692 (Why is no real title available?)1974-01-01Paper
scientific article; zbMATH DE number 3308672 (Why is no real title available?)1968-01-01Paper


Research outcomes over time


This page was built for person: Klaus Madlener