Dr Robert Powell, BSc MSc PhD
(email at email@example.com)
I graduated from Durham University in 2009 with a BSc in Natural Sciences (Mathematics and Computer Science), and then again in 2010 with a MSc in Internet Technology and Distributed Systems. From October 2010 to June 2016 I studied for a PhD in Complexity Theory under the supervision of Prof. Andrei Krokhin.
For 3 years I was a Teaching Fellow in the Department of Computer Science (formerly the School of Engineering and Computing Sciences). In August 2019 I took on a new role as Assistant Professor (Teaching) in Computer Sciene with additional responsibility for departmental IT provisions, including management of our GPU research cluster. .
Department of Computer Science
- Algorithms and Complexity
- Computational Complexity
- Constraint Satisfaction
- Algorithms and Data Structures (L1) (20 hours/year.)
- Computational Thinking - Bioinformatics (L1) (6 hours/year.)
- Computational Thinking - Ethics (L1) (4 hours/year.)
- Distributed Computing (MSc) (20 hours/year.)
- Research Methods and Professional Issues (MSc) (20 hours/year.)
- Cohen, D. Cooper, M., Jeavons, P. Krokhin, A., Powell, R. & Zivny, S. (2017). Binarisation for Valued Constraint Satisfaction Problems. SIAM Journal on Discrete Mathematics 31(4): 2279-2300.
- Huber, A., Krokhin, A. & Powell, R. (2013), Skew Bisubmodularity & Valued CSPs, SODA 2013. 1296-1305.