×

zbMATH — the first resource for mathematics

Madlener, Klaus E.

Compute Distance To:
Author ID: madlener.klaus-e Recent zbMATH articles by "Madlener, Klaus E."
Published as: Madlener, Klaus; Madlener, K.; Madlener, Klaus E.; Madlener, K. E.
Documents Indexed: 54 Publications since 1968, including 1 Book

Publications by Year

Citations contained in zbMATH Open

41 Publications have been cited 215 times in 136 Documents Cited by Year
Pseudo-natural algorithms for the word problem for finitely presented monoids and groups. Zbl 0591.20038
Madlener, Klaus; Otto, Friedrich
21
1985
About the descriptive power of certain classes of finite string-rewriting systems. Zbl 0697.20017
Madlener, Klaus; Otto, Friedrich
17
1989
Automatic monoids versus monoids with finite convergent presentations. Zbl 0914.20052
Otto, Friedrich; Sattler-Klein, Andrea; Madlener, Klaus
14
1998
Computing Gröbner bases in monoid and group rings. Zbl 0925.16015
Madlener, Klaus; Reinert, Birgit
13
1993
Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität. Zbl 0371.02019
Avenhaus, J.; Madlener, K.
11
1977
String matching and algorithmic problems in free groups. Zbl 0514.20026
Avenhaus, Juergen; Madlener, Klaus
11
1980
Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings. Zbl 0912.68104
Madlener, Klaus; Reinert, Birgit
10
1998
The Nielsen reduction and P-complete problems in free groups. Zbl 0555.20015
Avenhaus, J.; Madlener, K.
9
1984
Groups presented by finite two-monadic Church-Rosser Thue systems. Zbl 0604.20034
Avenhaus, J.; Madlener, K.; Otto, F.
8
1986
On groups defined by monadic Thue systems. Zbl 0608.20045
Avenhaus, J.; Madlener, K.
8
1986
A completion procedure for computing a canonical basis for a k- subalgebra. Zbl 0692.13001
Kapur, Deepak; Madlener, Klaus
8
1989
Separating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups. Zbl 0799.03049
Cohen, Daniel E.; Madlener, Klaus; Otto, Friedrich
7
1993
Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen. Zbl 0371.02020
Avenhaus, Jürgen; Madlener, K.
7
1978
Term rewriting and equational reasoning. Zbl 0704.68061
Avenhaus, J.; Madlener, K.
7
1990
String rewriting and Gröbner bases – a general approach to monoid and group rings. Zbl 0927.16044
Madlener, Klaus; Reinert, Birgit
6
1998
On weakly confluent monadic string-rewriting systems. Zbl 0778.68049
Madlener, K.; Narendran, P.; Otto, F.; Zhang, L.
5
1993
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Zbl 0396.03040
Avenhaus, J.; Madlener, K.
5
1978
How to compute generators for the intersection of subgroups in free groups. Zbl 0466.68036
Avenhaus, J.; Madlener, K.
5
1981
On the complexity of intersection and conjugacy problems in free groups. Zbl 0555.20016
Avenhaus, J.; Madlener, K.
5
1984
A specialized completion procedure for monadic string-rewriting systems presenting groups. Zbl 0769.68061
Madlener, K.; Narendran, P.; Otto, F.
4
1991
A generalization of Gröbner basis algorithms to polycyclic group rings. Zbl 0929.16024
Madlener, Klaus; Reinert, Birgit
4
1998
Decidable sentences for context-free groups. Zbl 0764.68086
Madlener, Klaus; Otto, Friedrich
3
1991
Computing presentations for subgroups of polycyclic groups and of context-free groups. Zbl 0807.20030
Kuhn, Norbert; Madlener, Klaus; Otto, Friedrich
3
1994
A generalization of Gröbner basis algorithms to nilpotent group rings. Zbl 0877.16012
Madlener, K.; Reinert, B.
2
1997
Theorem proving in hierarchical clausal specifications. Zbl 0867.68096
Avenhaus, J.; Madlener, K.
2
1997
Some undecidability results for finitely generated Thue congruences on a two-letter alphabet. Zbl 0888.68079
Madlener, Klaus; Otto, Friedrich
2
1997
String matching and algorithmic problems in free groups. Zbl 0431.03031
Avenhaus, Jürgen; Madlener, Klaus
2
1980
Using string-rewriting for solving the word problem for finitely presented groups. Zbl 0626.20025
Madlener, Klaus; Otto, Friedrich
2
1987
Pseudo-natural algorithms for finitely generated presentations of monoids and groups. Zbl 0665.20019
Madlener, Klaus; Otto, Friedrich
2
1988
Finitely generated derivation bounded presentations of groups. Zbl 0478.20025
Madlener, K.; Otto, F.
1
1982
On the problem of generating small convergent systems. Zbl 0804.68073
Madlener, Klaus; Sattler-Klein, Andrea; Otto, Friedrich
1
1993
Commutativity in groups presented by finite Church-Rosser Thue systems. Zbl 0649.20030
Madlener, Klaus; Otto, Friedrich
1
1988
\(E_n-E_{n-1}\)-entscheidbare Gruppen. Zbl 0314.02055
Avenhaus, J.; Madlener, K.
1
1975
Komplexitätsuntersuchungen für Einrelatorgruppen. Zbl 0359.02044
Avenhaus, J.; Madlener, K.
1
1977
Komplexität bei Gruppen: Der Einbettungssatz von Higman. Zbl 0363.20030
Avenhaus, J.; Madlener, K.
1
1977
An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation. Zbl 0494.20020
Avenhaus, J.; Madlener, K.
1
1981
Groups presented by certain classes of finite length-reducing string- rewriting systems. Zbl 0636.20022
Madlener, Klaus; Otto, Friedrich
1
1987
On groups having finite monadic Church-Rosser presentations. Zbl 0672.20015
Madlener, Klaus; Otto, Friedrich
1
1988
A note on Nielsen reduction and coset enumeration. Zbl 0922.20041
Reinert, Birgit; Madlener, Klaus; Mora, Teo
1
1998
The Nielsen reduction as key problem to polynomial algorithms in free groups. Zbl 0548.68038
Avenhaus, J.; Madlener, K.
1
1982
Some applications of prefix-rewriting in monoids, groups, and rings. Zbl 0987.20016
Madlener, Klaus; Otto, Friedrich
1
2000
Some applications of prefix-rewriting in monoids, groups, and rings. Zbl 0987.20016
Madlener, Klaus; Otto, Friedrich
1
2000
Automatic monoids versus monoids with finite convergent presentations. Zbl 0914.20052
Otto, Friedrich; Sattler-Klein, Andrea; Madlener, Klaus
14
1998
Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings. Zbl 0912.68104
Madlener, Klaus; Reinert, Birgit
10
1998
String rewriting and Gröbner bases – a general approach to monoid and group rings. Zbl 0927.16044
Madlener, Klaus; Reinert, Birgit
6
1998
A generalization of Gröbner basis algorithms to polycyclic group rings. Zbl 0929.16024
Madlener, Klaus; Reinert, Birgit
4
1998
A note on Nielsen reduction and coset enumeration. Zbl 0922.20041
Reinert, Birgit; Madlener, Klaus; Mora, Teo
1
1998
A generalization of Gröbner basis algorithms to nilpotent group rings. Zbl 0877.16012
Madlener, K.; Reinert, B.
2
1997
Theorem proving in hierarchical clausal specifications. Zbl 0867.68096
Avenhaus, J.; Madlener, K.
2
1997
Some undecidability results for finitely generated Thue congruences on a two-letter alphabet. Zbl 0888.68079
Madlener, Klaus; Otto, Friedrich
2
1997
Computing presentations for subgroups of polycyclic groups and of context-free groups. Zbl 0807.20030
Kuhn, Norbert; Madlener, Klaus; Otto, Friedrich
3
1994
Computing Gröbner bases in monoid and group rings. Zbl 0925.16015
Madlener, Klaus; Reinert, Birgit
13
1993
Separating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups. Zbl 0799.03049
Cohen, Daniel E.; Madlener, Klaus; Otto, Friedrich
7
1993
On weakly confluent monadic string-rewriting systems. Zbl 0778.68049
Madlener, K.; Narendran, P.; Otto, F.; Zhang, L.
5
1993
On the problem of generating small convergent systems. Zbl 0804.68073
Madlener, Klaus; Sattler-Klein, Andrea; Otto, Friedrich
1
1993
A specialized completion procedure for monadic string-rewriting systems presenting groups. Zbl 0769.68061
Madlener, K.; Narendran, P.; Otto, F.
4
1991
Decidable sentences for context-free groups. Zbl 0764.68086
Madlener, Klaus; Otto, Friedrich
3
1991
Term rewriting and equational reasoning. Zbl 0704.68061
Avenhaus, J.; Madlener, K.
7
1990
About the descriptive power of certain classes of finite string-rewriting systems. Zbl 0697.20017
Madlener, Klaus; Otto, Friedrich
17
1989
A completion procedure for computing a canonical basis for a k- subalgebra. Zbl 0692.13001
Kapur, Deepak; Madlener, Klaus
8
1989
Pseudo-natural algorithms for finitely generated presentations of monoids and groups. Zbl 0665.20019
Madlener, Klaus; Otto, Friedrich
2
1988
Commutativity in groups presented by finite Church-Rosser Thue systems. Zbl 0649.20030
Madlener, Klaus; Otto, Friedrich
1
1988
On groups having finite monadic Church-Rosser presentations. Zbl 0672.20015
Madlener, Klaus; Otto, Friedrich
1
1988
Using string-rewriting for solving the word problem for finitely presented groups. Zbl 0626.20025
Madlener, Klaus; Otto, Friedrich
2
1987
Groups presented by certain classes of finite length-reducing string- rewriting systems. Zbl 0636.20022
Madlener, Klaus; Otto, Friedrich
1
1987
Groups presented by finite two-monadic Church-Rosser Thue systems. Zbl 0604.20034
Avenhaus, J.; Madlener, K.; Otto, F.
8
1986
On groups defined by monadic Thue systems. Zbl 0608.20045
Avenhaus, J.; Madlener, K.
8
1986
Pseudo-natural algorithms for the word problem for finitely presented monoids and groups. Zbl 0591.20038
Madlener, Klaus; Otto, Friedrich
21
1985
The Nielsen reduction and P-complete problems in free groups. Zbl 0555.20015
Avenhaus, J.; Madlener, K.
9
1984
On the complexity of intersection and conjugacy problems in free groups. Zbl 0555.20016
Avenhaus, J.; Madlener, K.
5
1984
Finitely generated derivation bounded presentations of groups. Zbl 0478.20025
Madlener, K.; Otto, F.
1
1982
The Nielsen reduction as key problem to polynomial algorithms in free groups. Zbl 0548.68038
Avenhaus, J.; Madlener, K.
1
1982
How to compute generators for the intersection of subgroups in free groups. Zbl 0466.68036
Avenhaus, J.; Madlener, K.
5
1981
An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation. Zbl 0494.20020
Avenhaus, J.; Madlener, K.
1
1981
String matching and algorithmic problems in free groups. Zbl 0514.20026
Avenhaus, Juergen; Madlener, Klaus
11
1980
String matching and algorithmic problems in free groups. Zbl 0431.03031
Avenhaus, Jürgen; Madlener, Klaus
2
1980
Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen. Zbl 0371.02020
Avenhaus, Jürgen; Madlener, K.
7
1978
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Zbl 0396.03040
Avenhaus, J.; Madlener, K.
5
1978
Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität. Zbl 0371.02019
Avenhaus, J.; Madlener, K.
11
1977
Komplexitätsuntersuchungen für Einrelatorgruppen. Zbl 0359.02044
Avenhaus, J.; Madlener, K.
1
1977
Komplexität bei Gruppen: Der Einbettungssatz von Higman. Zbl 0363.20030
Avenhaus, J.; Madlener, K.
1
1977
\(E_n-E_{n-1}\)-entscheidbare Gruppen. Zbl 0314.02055
Avenhaus, J.; Madlener, K.
1
1975
all top 5

Cited by 146 Authors

27 Otto, Friedrich
14 Madlener, Klaus E.
8 Thomas, Richard M.
6 Avenhaus, Jürgen
6 Kobayashi, Yuji
5 Cain, Alan J.
4 Birget, Jean-Camille
4 Gray, Robert D.
4 Malheiro, António
4 Narendran, Paliath
4 Ol’shanskiĭ, Aleksandr Yur’evich
4 Zhang, Louxin
3 Book, Ronald Vernon
3 Ceria, Michela
3 Krivoj, S. L.
3 Mora, Teo
3 Sapir, Mark Valentinovich
3 Sénizergues, Géraud
2 Kambites, Mark
2 Katsura, Masashi
2 Kilgour, D. Marc
2 Parkes, Duncan W.
2 Piggott, Adam
2 Reinert, Birgit
2 Roggero, Margherita
2 Sokratova, Olga V.
2 Taylor, Brian D.
2 Wang, Xiaofeng
2 Wrochna, Marcin
1 Ackermann, Peter
1 Apel, Joachim
1 Araújo, João
1 Autebert, Jean-Michel
1 Avenhaus, Rudolf
1 Bauer, Günther
1 Beaudry, Martin
1 Bennett, Hanna
1 Bevers, Eddy
1 Biggs, Norman L.
1 Binyamin, Muhammad Ahsan
1 Boasson, Luc
1 Bokut, Leonid A.
1 Borges-Quintana, Mijail
1 Borges Trenard, Miguel Ángel
1 Brazil, Marcus N.
1 Buhler, Joe P.
1 Campbell, Colin Matthew
1 Campbell, H. E. A. Eddy
1 Cartwright, Donald I.
1 Cioffi, Francesca
1 Cohen, Daniel E.
1 Conti, Pasqualina
1 Descalço, L.
1 Diekert, Volker
1 Dison, Will
1 Dougherty, Daniel J.
1 Dukkipati, Ambedkar
1 Durnev, Valeriĭ Georgievich
1 Einstein, Eduard
1 Eisenberg, Andy
1 Forcheri, Paola
1 Francis, Maria
1 Garzon, Max H.
1 Gentilini, Paolo
1 Gerritzen, Lothar
1 Geser, Alfons
1 Godlevsky, A. B.
1 Guba, Victor S.
1 Hall, Becky Eide
1 Hermiller, Susan M.
1 Hipel, Keith William
1 Holzer, Markus
1 Johnson, Jeremiah William
1 Kapitonova, Yu. V.
1 Khan, Junaid Alam
1 Khan, Muhammad Abdul Basit
1 Kharlampovich, Olga G.
1 Kinyon, Michael K.
1 Kirchner, Hélène
1 Kirschmer, Markus
1 Konieczny, Janusz
1 Krajíček, Jan
1 Kreuzer, Martin
1 Krön, Bernhard
1 Kuhn, Norbert
1 Lakin, Stephen R.
1 Laun, Jürn
1 Leedham-Green, Charles R.
1 Levin, Alexander Borisovich
1 Lewi, Johan
1 Li, Lian
1 Lin, Hanling
1 Liu, Haining
1 Luks, Eugene M.
1 Maltcev, Victor
1 Månsson, Jonas
1 Margolis, Stuart W.
1 Markus-Epstein, L.
1 Martin, Ursula
1 Martins, Manuel António
...and 46 more Authors
all top 5

Cited in 43 Serials

26 Theoretical Computer Science
19 Journal of Symbolic Computation
11 International Journal of Algebra and Computation
7 Journal of Algebra
5 Acta Informatica
5 Mathematical Systems Theory
5 Transactions of the American Mathematical Society
5 Applicable Algebra in Engineering, Communication and Computing
3 Journal of Computer and System Sciences
3 Semigroup Forum
3 Information and Computation
2 Bulletin of the Australian Mathematical Society
2 Communications in Algebra
2 Discrete Applied Mathematics
2 Discrete Mathematics
2 Information Processing Letters
2 Mathematical Notes
2 Journal of Combinatorial Theory. Series A
2 Cybernetics
2 RAIRO. Informatique Théorique et Applications
2 Bulletin of Mathematical Sciences
1 Archiv für Mathematische Logik und Grundlagenforschung
1 Glasgow Mathematical Journal
1 Inventiones Mathematicae
1 Journal of Combinatorial Theory. Series B
1 Journal of Pure and Applied Algebra
1 Journal of Soviet Mathematics
1 RAIRO, Informatique Théorique
1 Theory and Decision
1 SIAM Journal on Discrete Mathematics
1 Stochastic Hydrology and Hydraulics
1 Annals of Operations Research
1 Cybernetics and Systems Analysis
1 Computational Complexity
1 Mathematical Logic Quarterly (MLQ)
1 Transformation Groups
1 Journal of Group Theory
1 Journal of the European Mathematical Society (JEMS)
1 RAIRO. Theoretical Informatics and Applications
1 Algebraic & Geometric Topology
1 Groups, Complexity, Cryptology
1 Symmetry
1 Journal of Combinatorial Algebra

Citations by Year