Brian Courtehoute

Computer Science PhD graduate with strong problem-solving and communication skills, and a passion for teaching.

Teaching

University of York

I’ve been a teaching assistant in several undergraduate Computer Science modules. This involved providing support in problem classes and marking.

• Computing by Graph Transformation (Spring 2019-20, 2021-22)
  A third year module on computing with rule-based Graph Transformation.
• Computability and Complexity (Autumn 2018-19, 2019-20, 2020-21, 2021-22)
  A second year module about Computability Theory and Complexity Theory.
• Mathematical Foundations of Computer Science (Spring 2018-19, 2020-21)
  A first year module about formal languages and various automata.

Education

• University of York - PhD in Computer Science (2018-2023)
  Analysed correctness and complexity of rule-based graph programs, improved the semantics of a graph programming language with a C compiler.
• University of Leeds - MSc in Mathematics and Computer Science (2017-2018)
  Focus on graph theory, computing, and foundational mathematics.
• University of Luxembourg - Bachelor in Mathematics (2014-2017)
  Focus on graph theory, computing, and foundational mathematics.

Publications

• B. Courtehoute
  Time and Space Complexity of Rule-based Graph Programs
  PhD Thesis. 2023.
  
• B. Courtehoute and D. Plump
  Time and Space Measures for a Complete Graph Computation Model
  Workshop on Graph Computation Models (GCM 2022), Revised Selected Papers. Electronic Proceedings in Theoretical Computer Science 374, pages 23-44, 2022.
  doi: 10.4204/EPTCS.374.4
• G. Campbell, B. Courtehoute and D. Plump
  Fast Rule-Based Graph Programs
  Science of Computer Programming 214. 2022.
  doi: 10.1016/j.scico.2021.102727
• B. Courtehoute and D. Plump
  A Small-Step Operational Semantics for GP 2
  Workshop on Graph Computation Models (GCM 2021), Revised Selected Papers. Electronic Proceedings in Theoretical Computer Science 350, pages 89-110, 2021.
  doi: 10.4204/EPTCS.350.6
• B. Courtehoute and D. Plump
  A Fast Graph Program for Computing Minimum Spanning Trees (Code, Timings)
  Workshop on Graph Computation Models (GCM 2020), Revised Selected Papers. Electronic Proceedings in Theoretical Computer Science 330, pages 163–180, 2020.
  doi: 10.4204/EPTCS.330.10
• G. Campbell, B. Courtehoute and D. Plump
  Linear-Time Graph Algorithms in GP 2
  Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Volume 139 of Leibniz International Proceedings in Informatics (LIPICS), pages 16:1-16:23, 2019.
  doi: 10.4230/LIPIcs.CALCO.2019.16

Talks

• Time and Space Complexity of Rule-based Graph Programs
  Research Group Seminar, Universiy of York, UK, 3 May 2023.
• Thesis Seminar
  Department of Computer Science, Universiy of York, UK, 22 September 2022.
• Time and Space Measures for a Complete Graph Computation Model
  13th International Workshop on Graph Computation Models, Nantes, France, 6 July 2022.
• A Small-Step Operational Semantics for GP 2
  12th International Workshop on Graph Computation Models, Online, 22 June 2021.
• A Fast Graph Program for Computing Minimum Spanning Trees
  11th International Workshop on Graph Computation Models, Online, 24 June 2020.
• Linear-Time Graph Algorithms in GP 2
  8th Conference on Algebra and Coalgebra in Computer Science, London, UK, 5 June 2019.
• Rule-Based Graph Programming: Linear-Time Graph Algorithms in GP 2
  35th British Colloquium for Theoretical Computer Science, Durham, UK, 17 April 2019.