Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Grindlinger M., “On Dehn's algorithms for the conjugacy and word problems with applications”, Commun. Pure Appl. Math., 13 (1960), 641–677 | DOI | MR
[2] Grindlinger M., “Dehn's algorithm for the word problem”, Commun. Pure Appl. Math., 13 (1960), 67–83 | DOI | MR
[3] Grindlinger M., “A class of groups all of whose elements have trivial centralizers”, Math. Z., 78 (1962), 91–96 | DOI | MR
[4] Grindlinger M. D., “Reshenie problemy sopryazhennosti dlya odnogo klassa grupp, sovpadayuschikh so svoimi antitsentrami, s pomoschyu obobschennogo algoritma Dena”, Doklady AN SSSR, 158 (1964), 1254–1256 | MR
[5] Grindlinger M. D., “Reshenie problemy tozhdestva dlya odnogo klassa grupp i problemy sopryazhennosti obobscheniem algoritma Dena”, Doklady AN SSSR, 154 (1964), 507–509 | MR
[6] Grindlinger M. D., “K probleme tozhdestva slov i sopryazhennosti”, Izvestiya AN SSSR, seriya matem., 29 (1965), 245–268 | MR
[7] Grindlinger M. D., “O probleme sopryazhennosti i sovpadeniya s antitsentrom v teorii grupp”, Sib. mat. zhurnal, 7 (1966), 785–803 | MR
[8] Grindlinger M. D., “Sopryazhennost podgrupp svobodnykh grupp”, Sib. mat. zhurnal, 11 (1970), 875–876 | MR | Zbl
[9] Grindlinger L., Grindlinger M., “On three of Lyndon's results about maps”, Contributions to group theory. Contemp. Math., 33 (1984), 212–213 | DOI