James D. Mitchell

Orcid: 0000-0002-5489-1617

According to our database1, James D. Mitchell authored at least 23 papers between 1994 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Certifying the Decidability of the Word Problem in Monoids at Large.
Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2026

2025
Minimal generating sets for matrix monoids.
J. Symb. Comput., 2025

Computing Embeddings and Isomorphisms of Finite Semigroups.
Proceedings of the Thirteenth International Symposium on Computing and Networking, 2025

2024
Properties of congruence lattices of graph inverse semigroups.
Int. J. Algebra Comput., May, 2024

Power Quotients of Plactic-like Monoids.
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, 2024

Computing congruences of finite inverse semigroups.
CoRR, 2024

2023
Polynomial time multiplication and normal forms in free bands.
Theor. Comput. Sci., April, 2023

Computing the congruences of a finite semigroup or monoid.
CoRR, 2023

Minimum degrees of finite rectangular bands, null semigroups, and variants of full transformation semigroups.
Comb. Theory, 2023

2022
Polynomial time multiplication and normal forms in free band.
CoRR, 2022

2021
An explicit algorithm for normal forms in small overlap monoids.
CoRR, 2021

2019
Computing finite semigroups.
J. Symb. Comput., 2019

2017
Parallel algorithms for computing finite semigroups.
CoRR, 2017

2016
Universal sequences for the order-automorphisms of the rationals.
J. Lond. Math. Soc., 2016

2014
SgpDec: Cascade (De)Compositions of Finite Transformation Semigroups and Permutation Groups.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2012
The Bergman-Shelah preorder on transformation semigroups.
Math. Log. Q., 2012

The Number of Nilpotent Semigroups of Degree 3.
Electron. J. Comb., 2012

2011
Algorithms for the Efficient Calculation of the Holonomy Decomposition.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
Computing automorphisms of semigroups.
J. Symb. Comput., 2010

Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances.
Ann. Pure Appl. Log., 2010

2008
Largest subsemigroups of the full transformation monoid.
Discret. Math., 2008

2005
An Elementary Proof That Every Singular Matrix Is a Product of Idempotent Matrices.
Am. Math. Mon., 2005

1994
SNORE: spike noise removal and detection.
IEEE Trans. Medical Imaging, 1994


  Loading...