Exponential Groups 2: Extensions of Centralizers and Tensor Completion of CSA-Groups. - Alexei G. Myasnikov; Vladimir N. Remeslennikov (Int. J. Algebra Comput., 1996)

Malnormality is Decidable in Free Groups. - Gilbert Baumslag; Alexei G. Myasnikov; Vladimir N. Remeslennikov (Int. J. Algebra Comput., 1999)

Generic-case complexity, decision problems in group theory and random walks - Ilya Kapovich; Alexei G. Myasnikov; Paul E. Schupp; Vladimir Shpilrain (CoRR, 2002)

Average-case complexity and decision problems in group theory - Ilya Kapovich; Alexei G. Myasnikov; Paul E. Schupp; Vladimir Shpilrain (CoRR, 2002)

Whitehead method and Genetic Algorithms - Alexei D. Miasnikov; Alexei G. Myasnikov (CoRR, 2003)

Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture - Alexei D. Miasnikov; Alexei G. Myasnikov (CoRR, 2003)

The Andrews-Curtis Conjecture and Black Box Groups. - Alexandre V. Borovik; Evgenii I. Khukhro; Alexei G. Myasnikov (Int. J. Algebra Comput., 2003)

Multiplicative Measures on Free Groups. - Alexandre V. Borovik; Alexei G. Myasnikov; Vladimir N. Remeslennikov (Int. J. Algebra Comput., 2003)

A Practical Attack on a Braid Group Based Cryptographic Protocol. - Alexei G. Myasnikov; Vladimir Shpilrain; Alexander Ushakov (CRYPTO, 2005)

Heuristics for the Whitehead Minimization Problem. - Robert M. Haralick; Alexei D. Miasnikov; Alexei G. Myasnikov (Exp. Math., 2005)

Foldings, Graphs of Groups and the Membership Problem. - Ilya Kapovich; Richard Weidmann; Alexei G. Myasnikov (Int. J. Algebra Comput., 2005)

Random Subgroups of Braid Groups: An Approach to Cryptanalysis of a Braid Group Based Cryptographic Protocol. - Alexei G. Myasnikov; Vladimir Shpilrain; Alexander Ushakov (Public Key Cryptography, 2006)

Fully Residually Free Groups and Graphs Labeled by Infinite Words. - Alexei G. Myasnikov; Vladimir N. Remeslennikov; Denis E. Serbin (Int. J. Algebra Comput., 2006)

The Halting Problem Is Decidable on a Set of Asymptotic Probability One. - Joel David Hamkins; Alexei Miasnikov (Notre Dame J. Formal Log., 2006)

Generic Complexity of Undecidable Problems. - Alexei G. Myasnikov (CSR, 2007)

Report on Generic Case Complexity - Robert H. Gilman 001; Alexei G. Myasnikov; Alex D. Myasnikov; Alexander Ushakov (CoRR, 2007)

Generic Complexity of the Conjugacy Problem in HNN-Extensions and Algorithmic Stratification of Miller's Groups. - Alexandre V. Borovik; Alexei G. Myasnikov; Vladimir N. Remeslennikov (Int. J. Algebra Comput., 2007)

The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes. - Alexandre V. Borovik; Alexei G. Myasnikov; Vladimir N. Remeslennikov (Int. J. Algebra Comput., 2007)

On Positive Theories of Groups with Regular Free Length Functions. - Bilal Khan 002; Alexei G. Myasnikov; Denis E. Serbin (Int. J. Algebra Comput., 2007)

Random subgroups and analysis of the length-based and quotient attacks. - Alexei G. Myasnikov; Alexander Ushakov (J. Math. Cryptol., 2008)

Generic complexity of undecidable problems. - Alexei G. Myasnikov; Alexander N. Rybalov (J. Symb. Log., 2008)

Generic Subgroups of Group Amalgams. - Benjamin Fine; Alexei G. Myasnikov; Gerhard Rosenberger (Groups Complex. Cryptol., 2009)

The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete. - Olga Kharlampovich; I. G. Lysënok; Alexei G. Myasnikov; Nicholas W. M. Touikan (Theory Comput. Syst., 2010)

Solving Word Problems in Group Extensions over Infinite Words. - Volker Diekert; Alexei G. Myasnikov (Developments in Language Theory, 2011)

Groups elementarily equivalent to a free nilpotent group of finite rank. - Alexei G. Myasnikov; Mahmood Sohrabi (Ann. Pure Appl. Log., 2011)

From automatic structures to automatic groups - Olga Kharlampovich; Bakhadyr Khoussainov; Alexei Miasnikov (CoRR, 2011)

Random equations in free groups. - Robert H. Gilman 001; Alexei G. Myasnikov; Vitalii Roman'kov (Groups Complex. Cryptol., 2011)

Random van Kampen diagrams and algorithmic problems in groups. - Alexei G. Myasnikov; Alexander Ushakov (Groups Complex. Cryptol., 2011)

Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic. - Alexei Miasnikov; Zoran Sunic (LATA, 2012)

Cyclic rewriting and conjugacy problems. - Volker Diekert; Andrew J. Duncan; Alexei G. Myasnikov (Groups Complex. Cryptol., 2012)

Preface. - Oleg Bogopolski; Olga Kharlampovich; Alexei G. Myasnikov (Int. J. Algebra Comput., 2012)

Power Circuits, exponential Algebra, and Time Complexity. - Alexei G. Myasnikov; Alexander Ushakov; Dong Wook Won (Int. J. Algebra Comput., 2012)

Group Extensions over Infinite Words. - Volker Diekert; Alexei G. Myasnikov (Int. J. Found. Comput. Sci., 2012)

The Post correspondence problem in groups. - Alexei G. Myasnikov; Andrey Nikolaev; Alexander Ushakov (CoRR, 2013)

Definable Sets in a hyperbolic Group. - Olga Kharlampovich; Alexei G. Myasnikov (Int. J. Algebra Comput., 2013)

Actions, Length Functions, and Non-Archimedean Words. - Olga Kharlampovich; Alexei G. Myasnikov; Denis E. Serbin (Int. J. Algebra Comput., 2013)

On Rationality of Verbal Subsets in a Group. - Alexei G. Myasnikov; Vitalii Roman'kov (Theory Comput. Syst., 2013)

Infinite words and universal free actions. - Olga Kharlampovich; Alexei G. Myasnikov; Denis E. Serbin (Groups Complex. Cryptol., 2014)

Diophantine cryptography in free metabelian groups: Theoretical base. - Alexei G. Myasnikov; Vitalii Roman'kov (Groups Complex. Cryptol., 2014)

Verbal subgroups of hyperbolic groups have infinite width. - Alexei G. Myasnikov; Andrey Nikolaev (J. Lond. Math. Soc., 2014)

An example of an automatic graph of intermediate growth. - Alexei Miasnikov; Dmytro Savchuk (Ann. Pure Appl. Log., 2015)

Logspace and compressed-word computations in nilpotent groups. - Jeremy MacDonald; Alexei G. Myasnikov; Andrey Nikolaev; Svetla Vassileva (CoRR, 2015)

Non-commutative lattice problems. - Alexei G. Myasnikov; Andrey Nikolaev; Alexander Ushakov (CoRR, 2015)

A linear decomposition attack. - Alexei G. Myasnikov; Vitalii Roman'kov (Groups Complex. Cryptol., 2015)

A Linear Attack on a Key Exchange Protocol Using Extensions of Matrix Semigroups. - Jintai Ding; Alexei Miasnikov; Alexander Ushakov (IACR Cryptol. ePrint Arch., 2015)

Groups acting on hyperbolic Λ-metric spaces. - Andrei-Paul Grecianu; Alexei V. Kvaschuk; Alexei G. Myasnikov; Denis E. Serbin (Int. J. Algebra Comput., 2015)

Knapsack problems in groups. - Alexei G. Myasnikov; Andrey Nikolaev; Alexander Ushakov (Math. Comput., 2015)

Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. - Volker Diekert; Alexei G. Myasnikov; Armin Weiß (Algorithmica, 2016)

The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$. - Alexei Miasnikov; Svetla Vassileva; Armin Weiß (CoRR, 2016)

Generic case completeness. - Alexei Miasnikov; Alexander Ushakov (J. Comput. Syst. Sci., 2016)

The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{ mathsf {T}}}{{ mathsf {C}}}^0$$. - Alexei Miasnikov; Svetla Vassileva; Armin Weiß (CSR, 2017)

TC0 Circuits for Algorithmic Problems in Nilpotent Groups. - Alexei G. Myasnikov; Armin Weiß (MFCS, 2017)

Computational complexity and the conjugacy problem. - Alexei Miasnikov; Paul E. Schupp (Comput., 2017)

TC^0 circuits for algorithmic problems in nilpotent groups. - Alexei G. Myasnikov; Armin Weiß (CoRR, 2017)

Random nilpotent groups, polycyclic presentations, and Diophantine problems. - Albert Garreta; Alexei Miasnikov; Denis Ovchinnikov (Groups Complex. Cryptol., 2017)

Log-space conjugacy problem in the Grigorchuk group. - Alexei Miasnikov; Svetla Vassileva (Groups Complex. Cryptol., 2017)

Distortion of embeddings of a torsion-free finitely generated nilpotent group into a unitriangular group. - Funda Gul; Alexei G. Myasnikov; Mahmood Sohrabi (Int. J. Algebra Comput., 2017)

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. - Volker Diekert; Alexei G. Myasnikov; Armin Weiß (J. Symb. Comput., 2017)

ω-stability and Morley Rank of Bilinear Maps, Rings and Nilpotent Groups. - Alexei G. Myasnikov; Mahmood Sohrabi (J. Symb. Log., 2017)

The tree property at the double successor of a singular cardinal with a larger gap. - Olga Kharlampovich; Alexei G. Myasnikov (Ann. Pure Appl. Log., 2018)

Algebraic geometry over algebraic structures X: Ordinal dimension. - Evelina Yur'evna Daniyarova; Alexei Georgievich Myasnikov; Vladimir Nikanorovich Remeslennikov (Int. J. Algebra Comput., 2018)

Equations in Algebras. - Olga Kharlampovich; Alexei G. Myasnikov (Int. J. Algebra Comput., 2018)

Characterization of finitely generated groups by types. - Alexei G. Myasnikov; Nikolay S. Romanovskii (Int. J. Algebra Comput., 2018)

Undecidability of the First order Theories of Free Noncommutative Lie Algebras. - Olga Kharlampovich; Alexei G. Myasnikov (J. Symb. Log., 2018)

Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131). - Volker Diekert; Olga Kharlampovich; Markus Lohrey; Alexei G. Myasnikov (Dagstuhl Reports, 2019)

Effective construction of covers of canonical Hom-diagrams for equations over torsion-free hyperbolic groups. - Olga Kharlampovich; Alexei G. Myasnikov; Alexander Taam (Groups Complex. Cryptol., 2019)

Low-complexity computations for nilpotent subgroup problems. - Jeremy MacDonald; Alexei Miasnikov; Denis Ovchinnikov (Int. J. Algebra Comput., 2019)

The complexity of verbal languages over groups. - Sanjay Jain 001; Alexei Miasnikov; Frank Stephan 001 (J. Comput. Syst. Sci., 2019)

The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0. - Alexei Miasnikov; Svetla Vassileva; Armin Weiß (Theory Comput. Syst., 2019)

On parameterized complexity of the word search problem in the Baumslag-Gersten group. - Alexei Miasnikov; Andrey Nikolaev (ISSAC, 2020)

The Diophantine problem in some metabelian groups. - Olga Kharlampovich; Laura López; Alexei G. Myasnikov (Math. Comput., 2020)

Hierarchy for groups acting on hyperbolic ℤn-spaces. - Andrei-Paul Grecianu; Alexei G. Myasnikov; Denis E. Serbin (Int. J. Algebra Comput., 2021)

Parallel complexity for nilpotent groups. - Alexei G. Myasnikov; Armin Weiß (Int. J. Algebra Comput., 2022)

U-MATH: A University-Level Benchmark for Evaluating Mathematical Skills in LLMs. - Konstantin Chernyshev; Vitaliy Polshkov; Ekaterina Artemova; Alexey D. Myasnikov; Vlad Stepanov; Alexei Miasnikov; Sergei Tilga (CoRR, 2024)