55 citations to https://www.mathnet.ru/eng/rm267
  1. V. A. Romankov, “Diofantova kriptografiya na beskonechnykh gruppakh”, PDM, 2012, no. 2(16), 15–42  mathnet
  2. E. G. Karpuz, A. S. Cevik, “Gröbner–Shirshov Bases for Extended modular, Extended Hecke, and Picard Groups”, Math. Notes, 92:5 (2012), 636–642  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib
  3. Alexei Myasnikov, Denis Osin, “Algorithmically finite groups”, Journal of Pure and Applied Algebra, 2011  crossref  mathscinet  isi  scopus
  4. Alexei Myasnikov, Alexander Ushakov, “Random van Kampen diagrams and algorithmic problems in groups”, Groups – Complexity – Cryptology, 3:3 (2011), 121  crossref  mathscinet  zmath  scopus
  5. Cain A.J., Maltcev V., “Decision problems for finitely presented and one-relation semigroups and monoids”, Internat. J. Algebra Comput., 19:6 (2009), 747–770  crossref  mathscinet  zmath  isi  scopus  scopus
  6. Karpuz E.G., Çevik A.S., “The word and generalized word problem for semigroups under wreath products”, Bull. Math. Soc. Sci. Math. Roum., Nouv. Sér., 52:2 (2009), 151–160  zmath  isi
  7. S. I. Adian, “Groups with Periodic Defining Relations”, Math. Notes, 83:3 (2008), 293–300  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
  8. Myasnikov A.G., Rybalov A.N., “Generic Complexity of Undecidable Problems”, J. Symb. Log., 73:2 (2008), 656–673  crossref  mathscinet  zmath  isi  elib  scopus  scopus
  9. Borovik A.V., Myasnikov A.G., Remeslennikov V.N., “The conjugacy problem in amalgamated products. I. Regular elements and black holes”, Internat. J. Algebra Comput., 17:7 (2007), 1299–1333  crossref  mathscinet  zmath  isi  elib  scopus  scopus
  10. Myasnikov A., “Generic Complexity of Undecidable Problems”, Computer Science - Theory and Applications, Lecture Notes in Computer Science, 4649, eds. Diekert V., Volkov M., Voronkov A., Springer-Verlag Berlin, 2007, 407–417  crossref  zmath  isi
Previous
1
2
3
4
5
6
Next