Alexei G. Myasnikov
Orcid: 0009-0006-7271-0011Affiliations:
- Stevens Institute of Technology, Hoboken, NJ, USA
According to our database1,
Alexei G. Myasnikov
authored at least 74 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
2022
2021
2020
On parameterized complexity of the word search problem in the Baumslag-Gersten group.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020
2019
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0.
Theory Comput. Syst., 2019
Int. J. Algebra Comput., 2019
Effective construction of covers of canonical Hom-diagrams for equations over torsion-free hyperbolic groups.
Groups Complex. Cryptol., 2019
Dagstuhl Reports, 2019
2018
J. Symb. Log., 2018
Int. J. Algebra Comput., 2018
Int. J. Algebra Comput., 2018
Ann. Pure Appl. Log., 2018
2017
J. Symb. Log., 2017
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.
J. Symb. Comput., 2017
Distortion of embeddings of a torsion-free finitely generated nilpotent group into a unitriangular group.
Int. J. Algebra Comput., 2017
Groups Complex. Cryptol., 2017
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\mathsf {T}}}{{\mathsf {C}}}^0$$.
Proceedings of the Computer Science - Theory and Applications, 2017
2016
The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$.
CoRR, 2016
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits.
Algorithmica, 2016
2015
IACR Cryptol. ePrint Arch., 2015
2014
Groups Complex. Cryptol., 2014
2013
2012
Int. J. Algebra Comput., 2012
Proceedings of the Language and Automata Theory and Applications, 2012
2011
Groups Complex. Cryptol., 2011
Ann. Pure Appl. Log., 2011
Proceedings of the Developments in Language Theory - 15th International Conference, 2011
2010
Theory Comput. Syst., 2010
2009
2008
J. Math. Cryptol., 2008
2007
Int. J. Algebra Comput., 2007
Int. J. Algebra Comput., 2007
Generic Complexity of the Conjugacy Problem in HNN-Extensions and Algorithmic Stratification of Miller's Groups.
Int. J. Algebra Comput., 2007
Proceedings of the Computer Science, 2007
2006
Notre Dame J. Formal Log., 2006
Int. J. Algebra Comput., 2006
Random Subgroups of Braid Groups: An Approach to Cryptanalysis of a Braid Group Based Cryptographic Protocol.
Proceedings of the Public Key Cryptography, 2006
2005
Proceedings of the Advances in Cryptology, 2005
2003
Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture
CoRR, 2003
2002
CoRR, 2002
1999
1996
Exponential Groups 2: Extensions of Centralizers and Tensor Completion of CSA-Groups.
Int. J. Algebra Comput., 1996