Our work in discrete mathematics is varied and covers several areas.
Our research into graph theory and combinatorics includes algorithmic and computational complexity aspects of graph and combinatorial problems. Work within our discrete mathematics group also covers research in information security. This includes the modelling and analysis of security and cryptographic protocols, modelling and analysis of human factors in security critical system, and threat modelling.
- Graph theory and algorithms: studies the fundamental properties of the underlying structures, with all unnecessary detail removed)
- Computational logic: a subject that applies methods from Formal Logic and Proof Theory to various fields in Computer Science and beyond)
- Constraint satisfaction problems: a multidisciplinary technology combining computer science, operational research and mathematics)
- Functional programming and applications: a high-level programming paradigm providing natural support for the analysis and verification of programs)
Senior Lecturer (Computing)
+44 (0)1382 385317