default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexei G. Myasnikov
Alexei Miasnikov – Alexei Georgievich Myasnikov
Person information
- affiliation: Stevens Institute of Technology, Hoboken, NJ, USA
- not to be confused with: Alex D. Myasnikov
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j52]Alexei G. Myasnikov
, Armin Weiß:
Parallel complexity for nilpotent groups. Int. J. Algebra Comput. 32(5): 895-928 (2022)- 2021
- [j51]Andrei-Paul Grecianu, Alexei G. Myasnikov, Denis E. Serbin:
Hierarchy for groups acting on hyperbolic ℤn-spaces. Int. J. Algebra Comput. 31(8): 1663-1690 (2021) - 2020
- [j50]Olga Kharlampovich, Laura López, Alexei G. Myasnikov:
The Diophantine problem in some metabelian groups. Math. Comput. 89(325): 2507-2519 (2020) - 2019
- [j49]Olga Kharlampovich, Alexei G. Myasnikov, Alexander Taam:
Effective construction of covers of canonical Hom-diagrams for equations over torsion-free hyperbolic groups. Groups Complex. Cryptol. 11(2): 83-101 (2019) - [j48]Jeremy MacDonald, Alexei Miasnikov, Denis Ovchinnikov:
Low-complexity computations for nilpotent subgroup problems. Int. J. Algebra Comput. 29(4): 639-661 (2019) - [j47]Sanjay Jain, Alexei Miasnikov, Frank Stephan:
The complexity of verbal languages over groups. J. Comput. Syst. Sci. 101: 68-85 (2019) - [j46]Alexei Miasnikov, Svetla Vassileva, Armin Weiß:
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0. Theory Comput. Syst. 63(4): 809-832 (2019) - 2018
- [j45]Olga Kharlampovich, Alexei G. Myasnikov:
The tree property at the double successor of a singular cardinal with a larger gap. Ann. Pure Appl. Log. 169(6): 523-547 (2018) - [j44]Evelina Yur'evna Daniyarova, Alexei Georgievich Myasnikov, Vladimir Nikanorovich Remeslennikov:
Algebraic geometry over algebraic structures X: Ordinal dimension. Int. J. Algebra Comput. 28(8): 1425-1448 (2018) - [j43]Olga Kharlampovich, Alexei G. Myasnikov:
Equations in Algebras. Int. J. Algebra Comput. 28(8): 1517-1533 (2018) - [j42]Alexei G. Myasnikov, Nikolay S. Romanovskii:
Characterization of finitely generated groups by types. Int. J. Algebra Comput. 28(8): 1613-1632 (2018) - [j41]Olga Kharlampovich, Alexei G. Myasnikov:
Undecidability of the First order Theories of Free Noncommutative Lie Algebras. J. Symb. Log. 83(3): 1204-1216 (2018) - 2017
- [j40]Alexei Miasnikov, Paul E. Schupp:
Computational complexity and the conjugacy problem. Comput. 6(4): 307-318 (2017) - [j39]Alexei Miasnikov, Svetla Vassileva:
Log-space conjugacy problem in the Grigorchuk group. Groups Complex. Cryptol. 9(1): 77 (2017) - [j38]Albert Garreta, Alexei Miasnikov, Denis Ovchinnikov:
Random nilpotent groups, polycyclic presentations, and Diophantine problems. Groups Complex. Cryptol. 9(2): 99-115 (2017) - [j37]Funda Gul, Alexei G. Myasnikov, Mahmood Sohrabi:
Distortion of embeddings of a torsion-free finitely generated nilpotent group into a unitriangular group. Int. J. Algebra Comput. 27(6): 633-653 (2017) - [j36]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. J. Symb. Comput. 83: 147-165 (2017) - [j35]Alexei G. Myasnikov, Mahmood Sohrabi:
ω-stability and Morley Rank of Bilinear Maps, Rings and Nilpotent Groups. J. Symb. Log. 82(2): 754-777 (2017) - 2016
- [j34]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. Algorithmica 76(4): 961-988 (2016) - [j33]Alexei Miasnikov, Alexander Ushakov:
Generic case completeness. J. Comput. Syst. Sci. 82(8): 1268-1282 (2016) - 2015
- [j32]Alexei Miasnikov, Dmytro Savchuk:
An example of an automatic graph of intermediate growth. Ann. Pure Appl. Log. 166(10): 1037-1048 (2015) - [j31]Alexei G. Myasnikov, Vitalii Roman'kov:
A linear decomposition attack. Groups Complex. Cryptol. 7(1): 81-94 (2015) - [j30]Andrei-Paul Grecianu, Alexei V. Kvaschuk, Alexei G. Myasnikov, Denis E. Serbin:
Groups acting on hyperbolic Λ-metric spaces. Int. J. Algebra Comput. 25(6): 977-1042 (2015) - [j29]Alexei G. Myasnikov, Andrey Nikolaev, Alexander Ushakov:
Knapsack problems in groups. Math. Comput. 84(292): 987-1016 (2015) - 2014
- [j28]Olga Kharlampovich, Alexei G. Myasnikov, Denis E. Serbin:
Infinite words and universal free actions. Groups Complex. Cryptol. 6(1): 55-69 (2014) - [j27]Alexei G. Myasnikov, Vitalii Roman'kov:
Diophantine cryptography in free metabelian groups: Theoretical base. Groups Complex. Cryptol. 6(2): 103-120 (2014) - [j26]Alexei G. Myasnikov, Andrey Nikolaev:
Verbal subgroups of hyperbolic groups have infinite width. J. Lond. Math. Soc. 90(2): 573-591 (2014) - 2013
- [j25]Olga Kharlampovich, Alexei G. Myasnikov:
Definable Sets in a hyperbolic Group. Int. J. Algebra Comput. 23(1): 91-110 (2013) - [j24]Olga Kharlampovich, Alexei G. Myasnikov, Denis E. Serbin:
Actions, Length Functions, and Non-Archimedean Words. Int. J. Algebra Comput. 23(2): 325- (2013) - [j23]Alexei G. Myasnikov, Vitalii Roman'kov:
On Rationality of Verbal Subsets in a Group. Theory Comput. Syst. 52(4): 587-598 (2013) - 2012
- [j22]Volker Diekert, Andrew J. Duncan, Alexei G. Myasnikov:
Cyclic rewriting and conjugacy problems. Groups Complex. Cryptol. 4(2): 321-355 (2012) - [j21]Alexei G. Myasnikov, Alexander Ushakov, Dong Wook Won:
Power Circuits, exponential Algebra, and Time Complexity. Int. J. Algebra Comput. 22(6) (2012) - [j20]Oleg Bogopolski, Olga Kharlampovich, Alexei G. Myasnikov:
Preface. Int. J. Algebra Comput. 22(8) (2012) - [j19]Volker Diekert, Alexei G. Myasnikov:
Group Extensions over Infinite Words. Int. J. Found. Comput. Sci. 23(5): 1001-1020 (2012) - 2011
- [j18]Alexei G. Myasnikov, Mahmood Sohrabi:
Groups elementarily equivalent to a free nilpotent group of finite rank. Ann. Pure Appl. Log. 162(11): 916-933 (2011) - [j17]Alexei G. Myasnikov, Alexander Ushakov:
Random van Kampen diagrams and algorithmic problems in groups. Groups Complex. Cryptol. 3(1): 121-185 (2011) - [j16]Robert H. Gilman, Alexei G. Myasnikov, Vitalii Roman'kov:
Random equations in free groups. Groups Complex. Cryptol. 3(2): 257-284 (2011) - 2010
- [j15]Olga Kharlampovich, I. G. Lysënok, Alexei G. Myasnikov, Nicholas W. M. Touikan:
The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete. Theory Comput. Syst. 47(1): 250-258 (2010) - 2009
- [j14]Benjamin Fine, Alexei G. Myasnikov, Gerhard Rosenberger:
Generic Subgroups of Group Amalgams. Groups Complex. Cryptol. 1(1): 51-61 (2009) - 2008
- [j13]Alexei G. Myasnikov, Alexander Ushakov:
Random subgroups and analysis of the length-based and quotient attacks. J. Math. Cryptol. 2(1): 29-61 (2008) - [j12]Alexei G. Myasnikov, Alexander N. Rybalov:
Generic complexity of undecidable problems. J. Symb. Log. 73(2): 656-673 (2008) - 2007
- [j11]Bilal Khan, Alexei G. Myasnikov, Denis E. Serbin:
On Positive Theories of Groups with Regular Free Length Functions. Int. J. Algebra Comput. 17(1): 1-26 (2007) - [j10]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(5/6): 963-997 (2007) - [j9]Alexandre V. Borovik, Alexei G. Myasnikov, Vladimir N. Remeslennikov:
The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes. Int. J. Algebra Comput. 17(7): 1299-1333 (2007) - 2006
- [j8]Alexei G. Myasnikov, Vladimir N. Remeslennikov, Denis E. Serbin:
Fully Residually Free Groups and Graphs Labeled by Infinite Words. Int. J. Algebra Comput. 16(4): 689-738 (2006) - [j7]Joel David Hamkins, Alexei Miasnikov:
The Halting Problem Is Decidable on a Set of Asymptotic Probability One. Notre Dame J. Formal Log. 47(4): 515-524 (2006) - 2005
- [j6]Robert M. Haralick, Alexei D. Miasnikov, Alexei G. Myasnikov:
Heuristics for the Whitehead Minimization Problem. Exp. Math. 14(1): 7-14 (2005) - [j5]Ilya Kapovich, Richard Weidmann, Alexei G. Myasnikov:
Foldings, Graphs of Groups and the Membership Problem. Int. J. Algebra Comput. 15(1): 95-128 (2005) - 2003
- [j4]Alexandre V. Borovik, Evgenii I. Khukhro, Alexei G. Myasnikov:
The Andrews-Curtis Conjecture and Black Box Groups. Int. J. Algebra Comput. 13(4): 415-436 (2003) - [j3]Alexandre V. Borovik, Alexei G. Myasnikov, Vladimir N. Remeslennikov:
Multiplicative Measures on Free Groups. Int. J. Algebra Comput. 13(6): 705-731 (2003) - 1999
- [j2]Gilbert Baumslag, Alexei G. Myasnikov, Vladimir N. Remeslennikov:
Malnormality is Decidable in Free Groups. Int. J. Algebra Comput. 9(6): 687-692 (1999) - 1996
- [j1]Alexei G. Myasnikov, Vladimir N. Remeslennikov:
Exponential Groups 2: Extensions of Centralizers and Tensor Completion of CSA-Groups. Int. J. Algebra Comput. 6(6): 687-712 (1996)
Conference and Workshop Papers
- 2020
- [c11]Alexei Miasnikov, Andrey Nikolaev:
On parameterized complexity of the word search problem in the Baumslag-Gersten group. ISSAC 2020: 360-363 - 2017
- [c10]Alexei Miasnikov, Svetla Vassileva, Armin Weiß:
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\mathsf {T}}}{{\mathsf {C}}}^0$$. CSR 2017: 217-231 - [c9]Alexei G. Myasnikov, Armin Weiß:
TC0 Circuits for Algorithmic Problems in Nilpotent Groups. MFCS 2017: 23:1-23:14 - 2015
- [c8]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem. ISSAC 2015: 141-148 - 2014
- [c7]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. LATIN 2014: 1-12 - 2012
- [c6]Alexei Miasnikov, Zoran Sunic:
Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic. LATA 2012: 401-407 - [c5]Sanjay Jain, Alexei Miasnikov, Frank Stephan:
The Complexity of Verbal Languages over Groups. LICS 2012: 405-414 - 2011
- [c4]Volker Diekert, Alexei G. Myasnikov:
Solving Word Problems in Group Extensions over Infinite Words. Developments in Language Theory 2011: 192-203 - 2007
- [c3]Alexei G. Myasnikov:
Generic Complexity of Undecidable Problems. CSR 2007: 407-417 - 2006
- [c2]Alexei G. Myasnikov, Vladimir Shpilrain, Alexander Ushakov:
Random Subgroups of Braid Groups: An Approach to Cryptanalysis of a Braid Group Based Cryptographic Protocol. Public Key Cryptography 2006: 302-314 - 2005
- [c1]Alexei G. Myasnikov, Vladimir Shpilrain, Alexander Ushakov:
A Practical Attack on a Braid Group Based Cryptographic Protocol. CRYPTO 2005: 86-96
Informal and Other Publications
- 2024
- [i21]Konstantin Chernyshev, Vitaliy Polshkov, Ekaterina Artemova, Alexey D. Myasnikov, Vlad Stepanov, Alexei Miasnikov, Sergei Tilga:
U-MATH: A University-Level Benchmark for Evaluating Mathematical Skills in LLMs. CoRR abs/2412.03205 (2024) - 2019
- [i20]Volker Diekert, Olga Kharlampovich, Markus Lohrey, Alexei G. Myasnikov:
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131). Dagstuhl Reports 9(3): 83-110 (2019) - 2017
- [i19]Alexei G. Myasnikov, Armin Weiß:
TC^0 circuits for algorithmic problems in nilpotent groups. CoRR abs/1702.06616 (2017) - 2016
- [i18]Alexei Miasnikov, Alexander Ushakov:
Generic case completeness. CoRR abs/1606.01172 (2016) - [i17]Alexei Miasnikov, Svetla Vassileva, Armin Weiß:
The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$. CoRR abs/1612.05954 (2016) - 2015
- [i16]Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. CoRR abs/1501.05579 (2015) - [i15]Jeremy MacDonald, Alexei G. Myasnikov, Andrey Nikolaev, Svetla Vassileva:
Logspace and compressed-word computations in nilpotent groups. CoRR abs/1503.03888 (2015) - [i14]Alexei G. Myasnikov, Andrey Nikolaev, Alexander Ushakov:
Non-commutative lattice problems. CoRR abs/1508.02388 (2015) - [i13]Jintai Ding, Alexei Miasnikov, Alexander Ushakov:
A Linear Attack on a Key Exchange Protocol Using Extensions of Matrix Semigroups. IACR Cryptol. ePrint Arch. 2015: 18 (2015) - 2013
- [i12]Alexei G. Myasnikov, Andrey Nikolaev, Alexander Ushakov:
Knapsack Problems in Groups. CoRR abs/1302.5671 (2013) - [i11]Volker Diekert, Alexei Miasnikov, Armin Weiß:
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits. CoRR abs/1309.5314 (2013) - [i10]Alexei G. Myasnikov, Andrey Nikolaev, Alexander Ushakov:
The Post correspondence problem in groups. CoRR abs/1310.5246 (2013) - 2011
- [i9]Olga Kharlampovich, Bakhadyr Khoussainov, Alexei Miasnikov:
From automatic structures to automatic groups. CoRR abs/1107.3645 (2011) - 2010
- [i8]Alexei G. Myasnikov, Alexander Ushakov, Dong Wook Won:
Power Circuits, Exponential Algebra, and Time Complexity. CoRR abs/1006.2570 (2010) - [i7]Volker Diekert, Alexei G. Myasnikov:
Group extensions over infinite words. CoRR abs/1011.2024 (2010) - 2007
- [i6]Robert H. Gilman, Alexei G. Myasnikov, Alex D. Myasnikov, Alexander Ushakov:
Report on Generic Case Complexity. CoRR abs/0707.1364 (2007) - [i5]Alexei G. Myasnikov, Alexander Ushakov:
Random subgroups and analysis of the length-based and quotient attacks. CoRR abs/0707.1501 (2007) - 2003
- [i4]Alexei D. Miasnikov, Alexei G. Myasnikov:
Whitehead method and Genetic Algorithms. CoRR math.GR/0304283 (2003) - [i3]Alexei D. Miasnikov, Alexei G. Myasnikov:
Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture. CoRR math.GR/0304305 (2003) - 2002
- [i2]Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain:
Generic-case complexity, decision problems in group theory and random walks. CoRR math.GR/0203239 (2002) - [i1]Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain:
Average-case complexity and decision problems in group theory. CoRR math.GR/0206273 (2002)
Coauthor Index
Vladimir Nikanorovich Remeslennikov
aka: Vladimir N. Remeslennikov
aka: Vladimir N. Remeslennikov
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
