selected scholarly activity
-
books
- Structure of Decidable Locally Finite Varieties. Ed. 79. 1989
-
conferences
- Sensitive instances of the constraint satisfaction problem. Leibniz International Proceedings in Informatics. 2020
- Algebras and Algorithms. Proceedings of The International Symposium on Multiple-Valued Logic. 1-1. 2015
- Learnability of solutions to conjunctive queries: The full dichotomy. Journal of machine learning research. 2015
- Generic Expression Hardness Results for Primitive Positive Formula Comparison. Lecture Notes in Computer Science. 344-355. 2011
- On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. Dagstuhl Seminar Proceedings. 2010
- Recent Results on the Algebraic Approach to the CSP. Lecture Notes in Computer Science. 68-92. 2008
- Tractability and learnability arising from algebras with few subpowers. Proceedings - Symposium on Logic in Computer Science. 213-+. 2007
- On Tractability and Congruence Distributivity. Proceedings - Symposium on Logic in Computer Science. 221-+. 2006
- Decidable Equational Classes. ALGEBRAIC MODEL THEORY. 207-221. 1997
-
journal articles
- Deciding the Existence of Minority Terms. Canadian Mathematical Bulletin. 63:577-591. 2020
- DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS. Journal of Symbolic Logic (JSL). 85:539-562. 2020
- Polynomial-time tests for difference terms in idempotent varieties. International Journal of Algebra and Computation. 29:927-949. 2019
- Testing for a Semilattice Term. Order. 36:65-76. 2019
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems. SIAM journal on computing (Print). 48:1022-1045. 2019
- Learnability of Solutions to Conjunctive Queries. Journal of machine learning research. 20. 2019
- Preserving near unanimity terms under products. Algebra Universalis. 76:293-300. 2016
- Testing Assignments to Constraint Satisfaction Problems. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2016-December:525-534. 2016
- Characterizations of several Maltsev conditions. Algebra Universalis. 73:205-224. 2015
- Idempotent n -permutable varieties. Bulletin of the London Mathematical Society. 46:870-880. 2014
- Generic expression hardness results for primitive positive formula comparison. Information and Computation. 222:108-120. 2013
- On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. Theory of Computing Systems. 50:329-353. 2012
- Varieties with few subalgebras of powers. Transactions of the American Mathematical Society. 362:1445-1473. 2010
- Tractability and Learnability Arising from Algebras with Few Subpowers. SIAM journal on computing (Print). 39:3023-3037. 2010
- OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT. International Journal of Algebra and Computation. 19:647-668. 2009
- A Subalgebra Intersection Property for Congruence Distributive Varieties. Canadian Journal of Mathematics. 61:451-464. 2009
- ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS. International Journal of Algebra and Computation. 19:41-77. 2009
- Definable principal congruences and solvability. Annals of Pure and Applied Logic. 157:30-49. 2009
- The structure of locally finite varieties with polynomially many models. Journal of The American Mathematical Society. 22:119-165. 2009
- On tractability and congruence distributivity. Logical Methods in Computer Science. Volume 3, Issue 2. 2007
- A property of the solvable radical in finitely decidable varieties. Fundamenta Mathematicae. 170:69-86. 2001
- A geometric consequence of residual smallness. Annals of Pure and Applied Logic. 99:137-169. 1999
- A modification of Polin's variety. Algebra Universalis. 41:229-231. 1999
- Minimal sets and varieties. Transactions of the American Mathematical Society. 350:1-41. 1998
- Minimal sets and varieties. Transactions of the American Mathematical Society. 350:1-41. 1998
- A RESIDUALLY SMALL, FINITELY GENERATED, SEMI-SIMPLE VARIETY WHICH IS NOT RESIDUALLY FINITE. International Journal of Algebra and Computation. 06:563-569. 1996
- Discriminating varieties. Algebra Universalis. 32:177-188. 1994
- Vaught's Conjecture for Varieties. Transactions of the American Mathematical Society. 342:173-173. 1994
- On Solvable Congruences in Finitely Decidable Varieties. Mathematical Logic Quarterly. 40:398-414. 1994
- Vaught’s conjecture for varieties. Transactions of the American Mathematical Society. 342:173-196. 1994
- Abelian algebras and the hamiltonian property. Journal of Pure and Applied Algebra. 87:37-49. 1993
- SOME PROPERTIES OF FINITELY DECIDABLE VARIETIES. International Journal of Algebra and Computation. 02:89-101. 1992
- Decidable discriminator varieties from unary varieties. Journal of Symbolic Logic (JSL). 56:1355-1368. 1991
- A Structure Theorem for Strongly Abelian Varieties with Few Models. Journal of Symbolic Logic (JSL). 56:832-832. 1991
- A structure theorem for strongly abelian varieties with few models. Journal of Symbolic Logic (JSL). 56:832-852. 1991
- A characterization of congruence permutable locally finite varieties. Journal of Algebra. 140:362-369. 1991
- Strongly Abelian Varieties and the Hamiltonian Property. Canadian Journal of Mathematics. 43:331-346. 1991
- Finite Simple Abelian Algebras are Strictly Simple. Proceedings of the American Mathematical Society. 108:49-49. 1990
- Finite simple abelian algebras are strictly simple. Proceedings of the American Mathematical Society. 108:49-49. 1990
- Decidable unary varieties. Algebra Universalis. 24:1-20. 1987
- Expanding varieties by monoids of endomorphisms. Algebra Universalis. 17:150-169. 1983
-
preprints