Prof. Barnaby Martin — Research Profile
Durham University · Department of Computer Science
Considering this lab for grad school?
Save it to compare side by side with other labs, and keep your contact prep in one place.
What to prepare before emailing a PIAbout
Prof. Barnaby Martin at Durham University Department of Computer Science lists Complexity Theory, Proof Complexity, Computational Complexity, Finite Model Theory, Constraint Satisfaction Problem, Algorithmic Graph Theory as their registered research area.
Research keywords
Other labs in this department
- Alexandra Cristea Lab
personalised web, Applied AI, Learner Analytics, Data Analytics, Semantic Web, Social Web, User Modelling, Web Science
- Amir Atapour-Abarghouei Lab
Neuromorphic perception and control, event-based vision, spiking neural networks, Efficient autonomy, Robust perception under shift, Anomaly and rare-event detection, Multimodal sensor fusion, Multimodal representation learning, Hardware-aware ML, Time-series modelling and streaming analytics, Trustworthy ML, Mapping and positioning, Scalable training systems, Resource-efficient neural architectures
- Amitabh Trehan Lab
Distributed and Network Algorithms, Graph Algorithms, CS Theory, Self-healing and Resilient Algorithms, Game Theory, Network Systems
- Andrei Krokhin Lab
combinatorics of graphs and ordered sets, computational complexity, homomorphism problems, mathematics of constraint satisfaction, universal algebra and logic in computer science
- Anish Jindal Lab
Data analytics, Smart City Applications, Green Artificial intelligence and Machine Learning, Cyber-physical systems and Internet-of-things, Programmable and scalable networking, Resource aware computing, Wireless network & security, Energy optimization
- Anne Reinarz Lab
High Performance Computing, Numerical Methods, Scientific Computing