1. D. Cenzer and J. B. Remmel, “Complexity and categoricity,” Inf. Comput., 140, No. 1, 2–25 (1998).
2. D. Cenzer and J. Remmel, “Polynomial-time versus recursive models,” Ann. Pure Appl. Log., 54, No. 1, 17–58 (1991).
3. D. Cenzer and J. Remmel, “Polynomial-time abelian groups,” Ann. Pure Appl. Log., 56, Nos. 1–3, 313–363 (1992).
4. D. Cenzer and J. B. Remmel, “Complexity theoretic model theory and algebra,” in Handbook of Recursive Mathematics, Vol. 1, Recursive Model Theory, Stud. Logic Found. Math., 138, Yu. L. Ershov et al. (eds.), Elsevier, Amsterdam (1998), pp. 381–513.
5. 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.