ALEXANDRE V. BOROVIK, ALEXEI G. MYASNIKOV, VLADIMIR N. REMESLENNIKOV, “GENERIC COMPLEXITY OF THE CONJUGACY PROBLEM IN HNN-EXTENSIONS AND ALGORITHMIC STRATIFICATION OF MILLER'S GROUPS”, Int. J. Algebra Comput., 17, no. 05n06, 2007, 963
Elizaveta Frenkel, Alexei G. Myasnikov, Vladimir N. Remeslennikov, Combinatorial and Geometric Group Theory, 2010, 93
Ilya Gekhtman, Samuel J. Taylor, Giulio Tiozzo, “Counting problems in graph products and relatively hyperbolic groups”, Isr. J. Math., 237, no. 1, 2020, 311
Robert H. Gilman, Alexei Myasnikov, Roman'kov Vitali, “Random equations in free groups”, Groups – Complexity – Cryptology, 3, no. 2, 2011
Alexander Rybalov, “On the strongly generic undecidability of the Halting Problem”, Theoretical Computer Science, 377, no. 1-3, 2007, 268
Alexei Miasnikov, Alexander Ushakov, “Generic case completeness”, Journal of Computer and System Sciences, 82, no. 8, 2016, 1268
Alexei G. Myasnikov, Alexander N. Rybalov, “Generic complexity of undecidable problems”, J. symb. log., 73, no. 2, 2008, 656
Ilya Gekhtman, Samuel J. Taylor, Giulio Tiozzo, “Counting loxodromics for hyperbolic actions”, Journal of Topology, 11, no. 2, 2018, 379
Alexei Myasnikov, 4649, Computer Science – Theory and Applications, 2007, 407
Alexei Myasnikov, Alexander Ushakov, “Random van Kampen diagrams and algorithmic problems in groups”, Groups – Complexity – Cryptology, 3, no. 1, 2011