| Tractability and learnability arising from algebras with few subpowers P Idziak, P Marković, R McKenzie, M Valeriote, R Willard SIAM Journal on Computing 39 (7), 3023-3037, 2010 | 198 | 2010 |
| Polymorphisms, and how to use them L Barto, A Krokhin, R Willard Dagstuhl Follow-Ups 7, 2017 | 168 | 2017 |
| Varieties with few subalgebras of powers J Berman, P Idziak, P Marković, R McKenzie, M Valeriote, R Willard Transactions of the American Mathematical Society 362 (3), 1445-1473, 2010 | 154 | 2010 |
| Characterizations of several Maltsev conditions M Kozik, A Krokhin, M Valeriote, R Willard Algebra universalis 73 (3), 205-224, 2015 | 88 | 2015 |
| Finitely many primitive positive clones S Burris, R Willard Proceedings of the American Mathematical Society 101 (3), 427-430, 1987 | 84 | 1987 |
| Essential arities of term operations in finite algebras R Willard Discrete Mathematics 149 (1-3), 239-259, 1996 | 75 | 1996 |
| A finite basis theorem for residually finite, congruence meet-semidistributive varieties R Willard The Journal of Symbolic Logic 65 (1), 187-200, 2000 | 61 | 2000 |
| Testing expressibility is hard R Willard Principles and Practice of Constraint Programming–CP 2010: 16th …, 2010 | 50 | 2010 |
| Natural dualities for quasivarieties generated by a finite commutative ring DM Clark, PM Idziak, LR Sabourin, C Szabó, R Willard Algebra Universalis 46 (1), 285-320, 2001 | 36 | 2001 |
| The dualisability of a quasi-variety is independent of the generating algebra BA Davey, R Willard Algebra Universalis 45, 103-106, 2001 | 36 | 2001 |
| Residually finite, congruence meet-semidistributive varieties of finite type have a finite residual bound K Kearnes, R Willard Proceedings of the American Mathematical Society 127 (10), 2841-2850, 1999 | 35 | 1999 |
| Near unanimity constraints have bounded pathwidth duality L Barto, M Kozik, R Willard 2012 27th Annual IEEE Symposium on Logic in Computer Science, 125-134, 2012 | 34 | 2012 |
| Full duality among graph algebras and flat graph algebras WA Lampe, GF McNulty, R Willard Algebra Universalis 45 (2), 311-334, 2001 | 30 | 2001 |
| New tools for proving dualizability R Willard Dualities, interpretability and ordered structures, 69-74, 1999 | 28 | 1999 |
| Full does not imply strong, does it? BA Davey, M Haviar, R Willard Algebra Universalis 54, 1-22, 2005 | 26 | 2005 |
| An algebra that is dualizable but not fully dualizable J Hyndman, R Willard Journal of Pure and Applied Algebra 151 (1), 31-42, 2000 | 25 | 2000 |
| Equational complexity of the finite algebra membership problem GF McNulty, Z Székely, R Willard International Journal of Algebra and Computation 18 (08), 1283-1319, 2008 | 22 | 2008 |
| Tarski’s finite basis problem via 𝐀 (𝒯) R Willard Transactions of the American Mathematical Society 349 (7), 2755-2774, 1997 | 22 | 1997 |
| Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) M Bodirsky, A Mottet, M Olšák, J Opršal, M Pinsker, R Willard 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2019 | 21 | 2019 |
| The lattice of alter egos BA Davey, JG Pitkethly, R Willard International Journal of Algebra and Computation 22 (01), 1250007, 2012 | 21 | 2012 |
