default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoss Willard
Person information
- affiliation: University of Waterloo, Department of Mathematics, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i4]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
ω-categorical structures avoiding height 1 identities. CoRR abs/2006.12254 (2020)
2010 – 2019
- 2019
- [c4]Manuel Bodirsky
, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS 2019: 1-12 - [i3]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). CoRR abs/1901.04237 (2019) - 2018
- [j11]Brian A. Davey, Jane G. Pitkethly, Ross Willard:
New-from-old full dualities via axiomatisation. Ann. Pure Appl. Log. 169(7): 588-615 (2018) - 2017
- [p1]Libor Barto, Andrei A. Krokhin, Ross Willard:
Polymorphisms, and How to Use Them. The Constraint Satisfaction Problem 2017: 1-44 - [i2]Ross Willard:
Refuting Feder, Kinne and Rafiey. CoRR abs/1707.09440 (2017) - 2012
- [j10]Brian A. Davey, Jane G. Pitkethly, Ross Willard:
The Lattice of Alter egos. Int. J. Algebra Comput. 22(1) (2012) - [c3]Libor Barto, Marcin Kozik, Ross Willard:
Near Unanimity Constraints Have Bounded Pathwidth Duality. LICS 2012: 125-134 - 2010
- [j9]Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard:
Tractability and Learnability Arising from Algebras with Few Subpowers. SIAM J. Comput. 39(7): 3023-3037 (2010) - [c2]Ross Willard:
Testing Expressibility Is Hard. CP 2010: 9-23
2000 – 2009
- 2009
- [i1]Ross Willard:
PP-DEFINABILITY IS CO-NEXPTIME-COMPLETE. The Constraint Satisfaction Problem: Complexity and Approximability 2009 - 2008
- [j8]George F. McNulty, Zoltán Székely, Ross Willard:
Equational Complexity of the Finite Algebra Membership Problem. Int. J. Algebra Comput. 18(8): 1283-1319 (2008) - 2007
- [c1]Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard:
Tractability and learnability arising from algebras with few subpowers. LICS 2007: 213-224 - 2004
- [j7]Ross Willard:
Determining Whether V(A) Has a Model Companion is Undecidable. Int. J. Algebra Comput. 14(3): 325-355 (2004) - 2000
- [j6]Ross Willard:
A Finite Basis Theorem for Residually Finite, Congruence Meet-Semidistributive Varieties. J. Symb. Log. 65(1): 187-200 (2000)
1990 – 1999
- 1999
- [j5]Keith A. Kearnes, Ross Willard:
Finiteness Properties of Locally Finite Abelian Varieties. Int. J. Algebra Comput. 9(2): 157-168 (1999) - 1996
- [j4]Ross Willard:
Essential arities of term operations in finite algebras. Discret. Math. 149(1-3): 239-259 (1996) - 1994
- [j3]Ross Willard:
Hereditary Undecidability of Some Theories of Finite Structures. J. Symb. Log. 59(4): 1254-1262 (1994) - 1992
- [j2]Matthew Valeriote, Ross Willard:
Some Properties of Finitely Decidable Varieties. Int. J. Algebra Comput. 2(1): 89-102 (1992)
1980 – 1989
- 1987
- [j1]Michael H. Albert, Ross Willard:
Injectives in Finitely Generated Universal Horn Classes. J. Symb. Log. 52(3): 786-792 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
