Klaus Madlener

From MaRDI portal
Person:580493

Available identifiers

zbMath Open madlener.klaus-eMaRDI QIDQ580493

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q47904432003-05-22Paper
Some applications of prefix-rewriting in monoids, groups, and rings2002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q47614642001-11-06Paper
https://portal.mardi4nfdi.de/entity/Q43949711999-11-02Paper
https://portal.mardi4nfdi.de/entity/Q42250621999-10-26Paper
https://portal.mardi4nfdi.de/entity/Q42342061999-10-11Paper
https://portal.mardi4nfdi.de/entity/Q42324931999-10-11Paper
https://portal.mardi4nfdi.de/entity/Q42342471999-09-08Paper
https://portal.mardi4nfdi.de/entity/Q42490331999-08-31Paper
https://portal.mardi4nfdi.de/entity/Q38387581999-06-20Paper
https://portal.mardi4nfdi.de/entity/Q42467371999-06-15Paper
A generalization of Gröbner basis algorithms to polycyclic group rings1999-02-15Paper
Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43495781998-06-01Paper
A generalization of Gröbner basis algorithms to nilpotent group rings1997-11-27Paper
https://portal.mardi4nfdi.de/entity/Q43362651997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q43103271995-08-27Paper
Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups1994-11-24Paper
On the problem of generating small convergent systems1994-08-31Paper
Computing presentations for subgroups of polycyclic groups and of context-free groups1994-08-29Paper
On weakly confluent monadic string-rewriting systems1994-01-09Paper
https://portal.mardi4nfdi.de/entity/Q40365701993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40356661993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q34843581990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30338661989-01-01Paper
About the descriptive power of certain classes of finite string-rewriting systems1989-01-01Paper
Pseudo-natural algorithms for finitely generated presentations of monoids and groups1988-01-01Paper
Commutativity in groups presented by finite Church-Rosser Thue systems1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38252361988-01-01Paper
Using string-rewriting for solving the word problem for finitely presented groups1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37757141987-01-01Paper
Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37484861986-01-01Paper
Pseudo-natural algorithms for the word problem for finitely presented monoids and groups1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47220581985-01-01Paper
The Nielsen reduction and P-complete problems in free groups1984-01-01Paper
On the complexity of intersection and conjugacy problems in free groups1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33401461982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39346011982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190781981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39571341981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39070681981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36599751980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38678191980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30488201979-01-01Paper
Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen1978-01-01Paper
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität1978-01-01Paper
Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41325161977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41373471977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40733661975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40739541974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55895921968-01-01Paper

Research outcomes over time

This page was built for person: Klaus Madlener