Structure of decidable locally finite varieties. - Ralph McKenzie; Matthew Valeriote (Birkhäuser, 1989)

Decidable Discriminator Varieties from Unary Varieties. - Stanley Burris; Ralph McKenzie; Matthew Valeriote (J. Symb. Log., 1991)

A Structure Theorem for Strongly Abelian Varieties with Few Models. - Bradd Hart; Matthew Valeriote (J. Symb. Log., 1991)

Some Properties of Finitely Decidable Varieties. - Matthew Valeriote; Ross Willard (Int. J. Algebra Comput., 1992)

On Solvable Congruences in Finitely Decidable Varieties. - Matthew Valeriote (Math. Log. Q., 1994)

A Residually Small, Finitely Generated, Semi-Simple Variety which is not Residually Finite. - Matthew Valeriote (Int. J. Algebra Comput., 1996)

A Geometric Consequence of Residual Smallness. - Keith A. Kearnes; Emil W. Kiss; Matthew Valeriote (Ann. Pure Appl. Log., 1999)

On tractability and congruence distributivity. - Emil W. Kiss; Matthew Valeriote (Log. Methods Comput. Sci., 2007)

Recent Results on the Algebraic Approach to the CSP. - Andrei A. Bulatov; Matthew Valeriote (Complexity of Constraints, 2008)

Definable principal congruences and solvability. - Pawel M. Idziak; Keith A. Kearnes; Emil W. Kiss; Matthew Valeriote (Ann. Pure Appl. Log., 2009)

On the Complexity of Some Maltsev Conditions. - Ralph Freese; Matthew Valeriote (Int. J. Algebra Comput., 2009)

Omitting Types, Bounded Width and the Ability to Count. - Benoît Larose; Matthew Valeriote; László Zádori (Int. J. Algebra Comput., 2009)

Tractability and Learnability Arising from Algebras with Few Subpowers. - Pawel M. Idziak; Petar Markovic; Ralph McKenzie; Matthew Valeriote; Ross Willard (SIAM J. Comput., 2010)

On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. - Simone Bova; Hubie Chen; Matthew Valeriote (Theory Comput. Syst., 2012)

Generic expression hardness results for primitive positive formula comparison. - Simone Bova; Hubie Chen; Matthew Valeriote (Inf. Comput., 2013)

Learnability of Solutions to Conjunctive Queries: The Full Dichotomy. - Hubie Chen; Matthew Valeriote (COLT, 2015)

Algebras and Algorithms. - Matthew Valeriote (ISMVL, 2015)

Testing Assignments to Constraint Satisfaction Problems. - Hubie Chen; Matthew Valeriote; Yuichi Yoshida (FOCS, 2016)

Deciding the existence of minority terms. - Alexandr Kazda; Jakub Oprsal; Matt Valeriote; Dmitriy Zhuk (CoRR, 2019)

Polynomial-time tests for difference terms in idempotent varieties. - William J. DeMeo; Ralph Freese; Matthew Valeriote (Int. J. Algebra Comput., 2019)

Learnability of Solutions to Conjunctive Queries. - Hubie Chen; Matthew Valeriote (J. Mach. Learn. Res., 2019)

Testing for a Semilattice Term. - Ralph Freese; James B. Nation; Matt Valeriote (Order, 2019)

Constant-Query Testability of Assignments to Constraint Satisfaction Problems. - Hubie Chen; Matt Valeriote; Yuichi Yoshida (SIAM J. Comput., 2019)

Sensitive Instances of the Constraint Satisfaction Problem. - Libor Barto; Marcin Kozik; Johnson Tan; Matt Valeriote (ICALP, 2020)

Deciding some Maltsev conditions in finite Idempotent Algebras. - Alexandr Kazda; Matt Valeriote (J. Symb. Log., 2020)