I am an Associate Professor in Computer Science with a PhD in mathematics, working at Coventry University since April 2015.

My research expertise is on algorithms of symbolic computation (the automation of exact symbolic mathematics) and their implementation in computer algebra systems. More specifically, I focus on algorithms of real algebraic geometry and computational logic. I have published on improved fundamental algorithms, their applications both direct (e.g. biology and economics) and in other areas of computer science (e.g. programming over complex numbers and motion planning). I am also involved in research that seeks to combine computer algebra systems with satisfiability modulo theory solvers, and to apply machine learning techniques to improve the performance of computer algebra systems without risking mathematical correctness.

I currently lead an ESPRC grant on the latter topic (embedding machine learning in quantifier elimination procedures) and I was the Coventry site PI for a large EU project on Satisfiability Checking and Symbolic Computation. I am available as a PhD adviser on the topics discussed above.

I am committee of the ACM Special Interest Group for Symbolic and Algebraic Manipulation (SIGSAM) and the ongoing PC Chair of the annual International Conference on Computer Algebra in Symbolic Computation (CASC).  

See my personal academic website for further details:
http://computing.coventry.ac.uk/~mengland/index.html

• Algorithms for Symbolic Computation
• Implementations in Computer Algebra Systems
• Algorithms for polynomial systems, real algebraic geometry and computational logic.
• Quantifier Elimination and Cylindrical Algebraic Decomposition
• Machine Learning for Software Optimisation
• Satisfiability Modulo Theories
• Applications of the above to sciences, engineering and economics.