◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Jackson

24 papers hereh-index 211.2k citations81 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author4
  • first author9
  • middle author6
  • last author4

Across the 23 of 24 papers where every author was matched, so the position is known.

fields
  • math.LO10
  • math.GR6
  • cs.CC3
  • math.CO3
  • cs.AI1
  • cs.LO1
same name
  • M. Jackson — 70 papers, h 49
  • M. Jackson — 44 papers
  • M. Jackson — 39 papers
  • M. Jackson — 32 papers, h 19
  • M. Jackson — 23 papers, h 71
  • M. Jackson — 7 papers, h 29

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092022
most citedA finer reduction of constraint problems to digraphs

19 citations · 81 across the 20 of their papers we have counts for

collaborators
Showing 2014Show all

4 papers · 1 filter

math.LO2014

The algebra of functions with antidomain and range

Robin Hirsch, Marcel Jackson, Szabolcs Mikulás

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. Th…

math.LO2014

Monoids with tests and the algebra of possibly non-halting programs

Marcel Jackson, Tim Stokes

We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equippe…

math.GR2014

Natural dualities, nilpotence and projective planes

Marcel Jackson

We use an interpretation of projective planes to show the inherent nondualisability of some finite semigroups. The method is sufficiently flexible to demonstrate the nondualisabili…

cs.CC2014★ 19 cited

A finer reduction of constraint problems to digraphs

Jakub Bulín, Dejan Delic, Marcel Jackson +1

It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.