Alexei G. Myasnikov

Int. J. Algebra Comput., 2022

2021

Hierarchy for groups acting on hyperbolic ℤn-spaces.

[BibT_eX]

[DOI]

Andrei-Paul Grecianu

Int. J. Algebra Comput., 2021

2020

The Diophantine problem in some metabelian groups.

[BibT_eX]

[DOI]

Laura López

Math. Comput., 2020

On parameterized complexity of the word search problem in the Baumslag-Gersten group.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

The complexity of verbal languages over groups.

[BibT_eX]

[DOI]

Sanjay Jain

Frank Stephan

J. Comput. Syst. Sci., 2019

Low-complexity computations for nilpotent subgroup problems.

[BibT_eX]

[DOI]

Jeremy MacDonald

Denis Ovchinnikov

Int. J. Algebra Comput., 2019

Effective construction of covers of canonical Hom-diagrams for equations over torsion-free hyperbolic groups.

[BibT_eX]

[DOI]

Alexander Taam

Groups Complex. Cryptol., 2019

Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

2018

Undecidability of the First order Theories of Free Noncommutative Lie Algebras.

[BibT_eX]

[DOI]

J. Symb. Log., 2018

Characterization of finitely generated groups by types.

[BibT_eX]

[DOI]

Nikolay S. Romanovskii

Int. J. Algebra Comput., 2018

Equations in Algebras.

[BibT_eX]

[DOI]

Evelina Yur'evna Daniyarova

Int. J. Algebra Comput., 2018

Algebraic geometry over algebraic structures X: Ordinal dimension.

[BibT_eX]

[DOI]

Alexei Georgievich Myasnikov

Vladimir Nikanorovich Remeslennikov

Int. J. Algebra Comput., 2018

The tree property at the double successor of a singular cardinal with a larger gap.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2018

2017

ω-stability and Morley Rank of Bilinear Maps, Rings and Nilpotent Groups.

[BibT_eX]

[DOI]

Mahmood Sohrabi

J. Symb. Log., 2017

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.

[BibT_eX]

[DOI]

J. Symb. Comput., 2017

Distortion of embeddings of a torsion-free finitely generated nilpotent group into a unitriangular group.

[BibT_eX]

[DOI]

Funda Gul

Mahmood Sohrabi

Int. J. Algebra Comput., 2017

Log-space conjugacy problem in the Grigorchuk group.

[BibT_eX]

[DOI]

Groups Complex. Cryptol., 2017

Random nilpotent groups, polycyclic presentations, and Diophantine problems.

[BibT_eX]

[DOI]

Albert Garreta

Denis Ovchinnikov

Groups Complex. Cryptol., 2017

TC^0 circuits for algorithmic problems in nilpotent groups.

[BibT_eX]

[DOI]

CoRR, 2017

Computational complexity and the conjugacy problem.

[BibT_eX]

[DOI]

Paul E. Schupp

Comput., 2017

TC<sup>0</sup> Circuits for Algorithmic Problems in Nilpotent Groups.

[BibT_eX]

[DOI]

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$$.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2017

2016

Generic case completeness.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$.

[BibT_eX]

[DOI]

CoRR, 2016

Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

Knapsack problems in groups.

[BibT_eX]

[DOI]

Math. Comput., 2015

Groups acting on hyperbolic Λ-metric spaces.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2015

A Linear Attack on a Key Exchange Protocol Using Extensions of Matrix Semigroups.

[BibT_eX]

[DOI]

Jintai Ding

IACR Cryptol. ePrint Arch., 2015

A linear decomposition attack.

[BibT_eX]

[DOI]

Groups Complex. Cryptol., 2015

Non-commutative lattice problems.

[BibT_eX]

[DOI]

CoRR, 2015

Logspace and compressed-word computations in nilpotent groups.

[BibT_eX]

[DOI]

CoRR, 2015

An example of an automatic graph of intermediate growth.

[BibT_eX]

[DOI]

Dmytro Savchuk

Ann. Pure Appl. Log., 2015

2014

Verbal subgroups of hyperbolic groups have infinite width.

[BibT_eX]

[DOI]

J. Lond. Math. Soc., 2014

Diophantine cryptography in free metabelian groups: Theoretical base.

[BibT_eX]

[DOI]

Groups Complex. Cryptol., 2014

Infinite words and universal free actions.

[BibT_eX]

[DOI]

Groups Complex. Cryptol., 2014

2013

On Rationality of Verbal Subsets in a Group.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Actions, Length Functions, and Non-Archimedean Words.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2013

Definable Sets in a hyperbolic Group.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2013

The Post correspondence problem in groups.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Group Extensions over Infinite Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Power Circuits, exponential Algebra, and Time Complexity.

[BibT_eX]

[DOI]

Dong Wook Won

Int. J. Algebra Comput., 2012

Preface.

[BibT_eX]

[DOI]

Oleg Bogopolski

Int. J. Algebra Comput., 2012

Cyclic rewriting and conjugacy problems.

[BibT_eX]

[DOI]

Andrew J. Duncan

Groups Complex. Cryptol., 2012

Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic.

[BibT_eX]

[DOI]

Zoran Sunic

Proceedings of the Language and Automata Theory and Applications, 2012

2011

Random van Kampen diagrams and algorithmic problems in groups.

[BibT_eX]

[DOI]

Groups Complex. Cryptol., 2011

Random equations in free groups.

[BibT_eX]

[DOI]

Robert H. Gilman

Groups Complex. Cryptol., 2011

From automatic structures to automatic groups

[BibT_eX]

[DOI]

Bakhadyr Khoussainov

CoRR, 2011

Groups elementarily equivalent to a free nilpotent group of finite rank.

[BibT_eX]

[DOI]

Mahmood Sohrabi

Ann. Pure Appl. Log., 2011

Solving Word Problems in Group Extensions over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete.

[BibT_eX]

[DOI]

I. G. Lysënok

Nicholas W. M. Touikan

Theory Comput. Syst., 2010

2009

Generic Subgroups of Group Amalgams.

[BibT_eX]

[DOI]

Benjamin Fine

Gerhard Rosenberger

Groups Complex. Cryptol., 2009

2008

Generic complexity of undecidable problems.

[BibT_eX]

[DOI]

Alexander N. Rybalov

J. Symb. Log., 2008

Random subgroups and analysis of the length-based and quotient attacks.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2008

2007

On Positive Theories of Groups with Regular Free Length Functions.

[BibT_eX]

[DOI]

Bilal Khan

Int. J. Algebra Comput., 2007

The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2007

Generic Complexity of the Conjugacy Problem in HNN-Extensions and Algorithmic Stratification of Miller's Groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2007

Report on Generic Case Complexity

[BibT_eX]

[DOI]

CoRR, 2007

Generic Complexity of Undecidable Problems.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2007

2006

The Halting Problem Is Decidable on a Set of Asymptotic Probability One.

[BibT_eX]

[DOI]

Joel David Hamkins

Notre Dame J. Formal Log., 2006

Fully Residually Free Groups and Graphs Labeled by Infinite Words.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2006

Random Subgroups of Braid Groups: An Approach to Cryptanalysis of a Braid Group Based Cryptographic Protocol.

[BibT_eX]

[DOI]

Vladimir Shpilrain

Proceedings of the Public Key Cryptography, 2006

2005

Foldings, Graphs of Groups and the Membership Problem.

[BibT_eX]

[DOI]

Ilya Kapovich

Richard Weidmann

Int. J. Algebra Comput., 2005

Heuristics for the Whitehead Minimization Problem.

[BibT_eX]

[DOI]

Robert M. Haralick

Alexei D. Miasnikov

Exp. Math., 2005

A Practical Attack on a Braid Group Based Cryptographic Protocol.

[BibT_eX]

[DOI]

Vladimir Shpilrain

Proceedings of the Advances in Cryptology, 2005

2003

Multiplicative Measures on Free Groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2003

The Andrews-Curtis Conjecture and Black Box Groups.

[BibT_eX]

[DOI]

Evgenii I. Khukhro

Int. J. Algebra Comput., 2003

Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture

[BibT_eX]

[DOI]

Alexei D. Miasnikov

CoRR, 2003

Whitehead method and Genetic Algorithms

[BibT_eX]

[DOI]

Alexei D. Miasnikov

CoRR, 2003

2002

Average-case complexity and decision problems in group theory

[BibT_eX]

[DOI]

CoRR, 2002

Generic-case complexity, decision problems in group theory and random walks

[BibT_eX]

[DOI]

CoRR, 2002

1999

Malnormality is Decidable in Free Groups.

[BibT_eX]

[DOI]

Gilbert Baumslag

Int. J. Algebra Comput., 1999

1996

Exponential Groups 2: Extensions of Centralizers and Tensor Completion of CSA-Groups.

[BibT_eX]

[DOI]