51 citations to https://www.mathnet.ru/eng/rm267
  1. S. I. Adian, “New estimates of odd exponents of infinite Burnside groups”, Proc. Steklov Inst. Math., 289 (2015), 33–71  mathnet  mathnet  crossref  crossref  isi  scopus
  2. V. N. Bezverkhnii, I. V. Dobrynina, “O svobodnykh podgruppakh v gruppakh Artina s drevesnoi strukturoi”, Chebyshevskii sb., 15:1 (2014), 32–42  mathnet
  3. J.W.. Johnson, “Weight ideals associated to regular and log-linear arrays”, Journal of Symbolic Computation, 2014  crossref  mathscinet  isi  scopus  scopus
  4. V. G. Durnev, O. V. Zetkina, “Nekotorye rezultaty, poluchennye v Yaroslavskom otdelenii algebraicheskoi shkoly M. D. Grindlingera”, Chebyshevskii sb., 15:4 (2014), 5–31  mathnet
  5. Charles F. Miller, Turing's Legacy, 2014, 329  crossref
  6. A. G. Myasnikov, V. N. Remeslennikov, E. V. Frenkel, “Amalgamated Free Product of Groups: Normal Forms and Measures”, Math. Notes, 91:4 (2012), 592–596  mathnet  crossref  crossref  mathscinet  isi  elib  elib
  7. V. A. Romankov, “Diofantova kriptografiya na beskonechnykh gruppakh”, PDM, 2012, no. 2(16), 15–42  mathnet
  8. 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
  9. Alexei Myasnikov, Denis Osin, “Algorithmically finite groups”, Journal of Pure and Applied Algebra, 2011  crossref  mathscinet  isi  scopus
  10. Alexei Myasnikov, Alexander Ushakov, “Random van Kampen diagrams and algorithmic problems in groups”, Groups – Complexity – Cryptology, 3:3 (2011), 121  crossref  mathscinet  zmath  scopus
Previous
1
2
3
4
5
6
Next