default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcel Jackson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Marcel Jackson
, Tim Stokes:
Restriction in Program Algebra. Log. J. IGPL 31(5): 926-960 (2023)- 2022
- [i14]Badriah Al Juaid, Marcel Jackson, James Koussas, Tomasz Kowalski:
Qualitative representations of chromatic algebras. CoRR abs/2201.03098 (2022) - [i13]Lucy Ham, Marcel Jackson:
Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity. CoRR abs/2212.02653 (2022)
2010 – 2019
- 2019
- [j18]Marcel Jackson, Szabolcs Mikulás:
Domain and range for angelic and demonic compositions. J. Log. Algebraic Methods Program. 103: 62-78 (2019) - [j17]Robin Hirsch, Marcel Jackson, Tomasz Kowalski:
Algebraic foundations for qualitative calculi and networks. Theor. Comput. Sci. 768: 99-116 (2019) - [i12]Marcel Jackson, Tim Stokes:
Override and update. CoRR abs/1907.08336 (2019) - 2018
- [i11]Marcel Jackson, Szabolcs Mikulás:
Domain and range for angelic and demonic compositions. CoRR abs/1811.01712 (2018) - 2017
- [j16]Attila Egri-Nagy, Marcel Jackson, John Rhodes, Benjamin Steinberg:
On the atoms of algebraic lattices arising in 픮-theory. Int. J. Algebra Comput. 27(2): 157-188 (2017) - [c5]Lucy Ham, Marcel Jackson:
All or Nothing: Toward a Promise Problem Dichotomy for Constraint Problems. CP 2017: 139-156 - [i10]Lucy Ham, Marcel Jackson:
Axiomatisability and hardness for universal Horn classes of hypergraphs. CoRR abs/1704.02099 (2017) - 2016
- [j15]Marcel Jackson, Tomasz Kowalski, Todd Niven:
Complexity and polymorphisms for digraph constraint problems under some basic constructions. Int. J. Algebra Comput. 26(7): 1395-1433 (2016) - [i9]Robin Hirsch, Marcel Jackson, Tomasz Kowalski, Todd Niven:
Algebraic foundations for qualitative calculi and networks. CoRR abs/1606.09140 (2016) - [i8]Marcel Jackson:
Low growth equational complexity. CoRR abs/1607.07156 (2016) - [i7]Lucy Ham, Marcel Jackson:
All or nothing: toward a promise problem dichotomy for constraint problems. CoRR abs/1611.00886 (2016) - 2015
- [j14]Catarina Carvalho, László Egri, Marcel Jackson, Todd Niven:
On Maltsev Digraphs. Electron. J. Comb. 22(1): 1 (2015) - [j13]Jakub Bulin, Dejan Delic, Marcel Jackson, Todd Niven:
A finer reduction of constraint problems to digraphs. Log. Methods Comput. Sci. 11(4) (2015) - [j12]Marcel Jackson, Tim Stokes:
Monoids with tests and the algebra of possibly non-halting programs. J. Log. Algebraic Methods Program. 84(2): 259-275 (2015) - [i6]Marcel Jackson:
Flexible constraint satisfiability and a problem in semigroup theory. CoRR abs/1512.03127 (2015) - 2014
- [i5]Marcel Jackson, Tim Stokes:
Monoids with tests and the algebra of possibly non-halting programs. CoRR abs/1408.4498 (2014) - [i4]Robin Hirsch, Marcel Jackson, Szabolcs Mikulás:
The algebra of functions with antidomain and range. CoRR abs/1410.3981 (2014) - 2013
- [j11]Marcel Jackson, Belinda Trotta:
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring. Stud Logica 101(1): 65-94 (2013) - [c4]Jakub Bulin, Dejan Delic, Marcel Jackson, Todd Niven:
On the Reduction of the CSP Dichotomy Conjecture to Digraphs. CP 2013: 184-199 - [i3]Marcel Jackson, Tomasz Kowalski, Todd Niven:
Digraph related constructions and the complexity of digraph homomorphism problems. CoRR abs/1304.4986 (2013) - [i2]Jakub Bulin, Dejan Delic, Marcel Jackson, Todd Niven:
On the reduction of the CSP dichotomy conjecture to digraphs. CoRR abs/1305.2039 (2013) - 2012
- [j10]Robin Hirsch, Marcel Jackson:
Undecidability of representability as binary relations. J. Symb. Log. 77(4): 1211-1244 (2012) - [j9]Robert Goldblatt, Marcel Jackson:
Well-structured program equivalence is highly undecidable. ACM Trans. Comput. Log. 13(3): 26:1-26:8 (2012) - 2011
- [j8]Marcel Jackson, Timothy Stokes:
Modal restriction Semigroups: towards an Algebra of Functions. Int. J. Algebra Comput. 21(7): 1053-1095 (2011) - [c3]Christopher Mears, Todd Niven, Marcel Jackson, Mark Wallace:
Proving Symmetries by Model Transformation. CP 2011: 591-605 - [c2]Catarina Carvalho, László Egri, Marcel Jackson, Todd Niven:
On Maltsev Digraphs. CSR 2011: 181-194 - [i1]Robert Goldblatt, Marcel Jackson:
Well structured program equivalence is highly undecidable. CoRR abs/1103.1433 (2011) - 2010
- [c1]Marcel Jackson, Mikhail V. Volkov:
The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion. Fields of Logic and Computation 2010: 414-443
2000 – 2009
- 2009
- [j7]Marcel Jackson, Timothy Stokes:
SEMIGROUPS WITH if-then-else AND HALTING PROGRAMS. Int. J. Algebra Comput. 19(7): 937-961 (2009) - 2008
- [j6]Marcel Jackson:
Flat algebras and the translation of universal Horn logic to equational logic. J. Symb. Log. 73(1): 90-128 (2008) - 2006
- [j5]Marcel Jackson, Ralph McKenzie:
Interpreting Graph Colorability in Finite Semigroups. Int. J. Algebra Comput. 16(1): 119-140 (2006) - [j4]Marcel Jackson, Timothy Stokes:
Identities in the Algebra of Partial Maps. Int. J. Algebra Comput. 16(6): 1131-1160 (2006) - 2005
- [j3]Marcel Jackson:
Finite Semigroups with Infinite Irredundant Identity Bases. Int. J. Algebra Comput. 15(3): 405-422 (2005) - 2003
- [j2]Marcel Jackson:
Dualisability of Finite Semigroups. Int. J. Algebra Comput. 13(4): 481-497 (2003) - 2000
- [j1]Marcel Jackson, Olga Sapir:
Finitely Based, Finite Sets of Words. Int. J. Algebra Comput. 10(6): 683-708 (2000)
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-10-07 22:09 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:
