K. A. Baker and A. F. Pixley , Polynomial interpolation and the Chinese remainder theorem, Mathematische Zeitschrift, vol. 143 (1975), pp. 165–174.
 A. Bulatov , A. A. Krokhin , and P. Jeavons , Constraint satisfaction problems and finite algebras, Lecture Notes in Computer Science, vol. 1853 (2000), pp. 272–282.
 B. A. Davey , L. Heindorf , and R. McKenzie , Near unanimity: an obstacle to general duality theory, Algebra Universalis, vol. 33 (1995), pp. 428–439.
 T. Feder and M. Y. Vardi , The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory, SIAM Journal of Computing, vol. 28 (1998), no. 1, pp. 57–104.
 P. Jeavons , D. Cohen , and M. C. Cooper , Constraints, consistency and closure, Artificial Intelligence, vol. 101 (1998), pp. 251–265.
 L. Lovász , Kneser's conjecture, chromatic numbers and homotopy, Journal of Combinatorial Theory, Series A, vol. 25 (1978), pp. 319–324.
 M. Maróti , On the (un) decidability of a near-unanimity term, Algebra Universalis, vol. 57 (2007), no. 2, pp. 215–237.
 M. Maróti and R. McKenzie , Existence theorems for weakly symmetric operations, Algebra Universalis, vol. 59 (2008), no. 3-4, pp. 463–489.