1. Bulatov, A.A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings 43rd IEEE Symposium on Foundations of Computer Science, FOCS 2002, Vancouver, Canada, November 2002, pp. 649–658 (2002)
2. Bulatov, A.A.: Mal’tsev constraints are tractable. Technical Report PRG-RR-02- 05, Computing Laboratory, University of Oxford, Oxford, UK (2002)
3. Bulatov, A.A., Jeavons, P.G.: Tractable constraints closed under a binary operation. Technical Report PRG-TR-12-00, Computing Laboratory, University of Oxford, Oxford, UK (2000)
4. Bulatov, A.A., Jeavons, P.G.: An algebraic approach to multi-sorted constraints. Technical Report PRG-RR-01-18, Computing Laboratory, University of Oxford, Oxford, UK (2001)
5. Bulatov, A.A., Jeavons, P.G., Krokhin, A.A.: The complexity of maximal constraint languages. In: Proceedings of the 33rd Annual ACM Simposium on Theory of Computing, Hersonissos, Crete, Greece, pp. 667–674. ACM Press, New York (2001)