1. P. E. Alaev, “Existence and uniqueness of structures computable in polynomial time,” Algebra and Logic, 55, No. 1, 72-76 (2016).
2. P. E. Alaev, “Structures computable in polynomial time. I,” Algebra and Logic, 55, No. 6, 421-435 (2016).
3. D. Cenzer and J. B. Remmel, “Complexity theoretic model theory and algebra,” in Handbook of Recursive Mathematics, Vol. 1, Recursive Model Theory, Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (Eds.), Stud. Log. Found. Math., 138, Elsevier, Amsterdam (1998), pp. 381-513.
4. E. I. Latkin, “Polynomial non-autostability. Algebraic approach,” in Logical Methods in Programming, Vychislitel’nye Systemy, 133, Sobolev Institute of Mathematics, Novosibirsk (1990), pp. 14-37.
5. I. Kalimullin, A. Melnikov A., and K. M. Ng, “Algebraic structures computable without delay”, Theor. Comput. Sci., 674, 73098 (2017).