| Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. | 0 | 0.34 | 2020 |
| Decidability problems in automaton semigroups. | 0 | 0.34 | 2017 |
| The word and order problems for self-similar and automata groups | 0 | 0.34 | 2017 |
| Commutator width in the first Grigorchuk group. | 0 | 0.34 | 2017 |
| Amenability of groups is characterized by Myhill's theorem | 0 | 0.34 | 2016 |
| Algorithmic aspects of branched coverings II. Sphere bisets and their decompositions. | 0 | 0.34 | 2016 |
| Algorithmic decidability of Engel's property for automaton groups | 0 | 0.34 | 2015 |
| Algorithmic aspects of branched coverings | 0 | 0.34 | 2015 |
| The rational homology of the outer automorphism group of $F_7$ | 0 | 0.34 | 2015 |
| Lie Dimension Subrings | 0 | 0.34 | 2015 |
| Computer Solution to the Game of Pure Strategy. | 6 | 0.47 | 2012 |
| Hodge Theory on Metric Spaces | 5 | 0.70 | 2012 |
| The Game of Pure Strategy is solved! | 0 | 0.34 | 2012 |
| Rational subsets of groups | 2 | 0.40 | 2010 |
| Groups defined by automata | 6 | 0.56 | 2010 |
| The Twisted Twin Of The Grigorchuk Group | 2 | 0.58 | 2010 |
| A Mealy Machine With Polynomial Growth Of Irrational Degree | 2 | 0.49 | 2008 |
| A Nilpotent Quotient Algorithm For Certain Infinitely Presented Groups And Its Applications | 2 | 0.52 | 2008 |
| A converse to Moore's theorem on cellular automata | 0 | 0.34 | 2007 |
| Lower Bounds On The Growth Of A Group Acting On The Binary Rooted Tree | 2 | 0.64 | 2001 |
| Lamps, Factorizations, and Finite Fields. | 0 | 0.34 | 2000 |
