Marcel Jackson

Orcid: 0000-0002-8149-1141

According to our database1, Marcel Jackson authored at least 32 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Restriction in Program Algebra.
Log. J. IGPL, September, 2023

2022
Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity.
CoRR, 2022

Qualitative representations of chromatic algebras.
CoRR, 2022

2019
Algebraic foundations for qualitative calculi and networks.
Theor. Comput. Sci., 2019

Domain and range for angelic and demonic compositions.
J. Log. Algebraic Methods Program., 2019

Override and update.
CoRR, 2019

2017
On the atoms of algebraic lattices arising in 픮-theory.
Int. J. Algebra Comput., 2017

Axiomatisability and hardness for universal Horn classes of hypergraphs.
CoRR, 2017

All or Nothing: Toward a Promise Problem Dichotomy for Constraint Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2017

2016
Complexity and polymorphisms for digraph constraint problems under some basic constructions.
Int. J. Algebra Comput., 2016

Low growth equational complexity.
CoRR, 2016

Algebraic foundations for qualitative calculi and networks.
CoRR, 2016

2015
Monoids with tests and the algebra of possibly non-halting programs.
J. Log. Algebraic Methods Program., 2015

Flexible constraint satisfiability and a problem in semigroup theory.
CoRR, 2015

A finer reduction of constraint problems to digraphs.
Log. Methods Comput. Sci., 2015

On Maltsev Digraphs.
Electron. J. Comb., 2015

2014
The algebra of functions with antidomain and range.
CoRR, 2014

2013
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring.
Stud Logica, 2013

Digraph related constructions and the complexity of digraph homomorphism problems
CoRR, 2013

On the Reduction of the CSP Dichotomy Conjecture to Digraphs.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
Well-structured program equivalence is highly undecidable.
ACM Trans. Comput. Log., 2012

Undecidability of representability as binary relations.
J. Symb. Log., 2012

2011
Modal restriction Semigroups: towards an Algebra of Functions.
Int. J. Algebra Comput., 2011

Proving Symmetries by Model Transformation.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010
The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion.
Proceedings of the Fields of Logic and Computation, 2010

2009
SEMIGROUPS WITH if-then-else AND HALTING PROGRAMS.
Int. J. Algebra Comput., 2009

2008
Flat algebras and the translation of universal Horn logic to equational logic.
J. Symb. Log., 2008

2006
Identities in the Algebra of Partial Maps.
Int. J. Algebra Comput., 2006

Interpreting Graph Colorability in Finite Semigroups.
Int. J. Algebra Comput., 2006

2005
Finite Semigroups with Infinite Irredundant Identity Bases.
Int. J. Algebra Comput., 2005

2003
Dualisability of Finite Semigroups.
Int. J. Algebra Comput., 2003

2000
Finitely Based, Finite Sets of Words.
Int. J. Algebra Comput., 2000


  Loading...