1. V. Diekert, J. Laun, A. Ushakov, Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. Int. J. Algebra Comput. 22(8), 19 p (2012)
2. V. Diekert, O. Kharlampovich, A.M. Moghaddam, SLP compression for solutions of equations with constraints in free and hyperbolic groups. Technical Report. arXiv.org (2013),
http://arxiv.org/abs/1308.5586
3. C. Gutiérrez, Satisfiability of equations in free groups is in PSPACE. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000 (ACM Press, New York, 2000), pp. 21–27
4. N. Haubold, M. Lohrey, C. Mathissen, Compressed decision problems for graph products of groups and applications to (outer) automorphism groups. Int. J. Algebra Comput. 22(8), 53 p (2013)
5. A. Jėz, Compressed membership for NFA (DFA) with compressed labels is in NP (P). In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012. Leibniz International Proceedings in Informatics, vol. 14 (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2012), pp. 136–147