Biography

I am a docent1 in computing science at the IT Department in the Computing Science Division (CSD). Most of my research is related to artificial intelligence and optimisation. See here for details of optimisation research at CSD.

Together with Pierre Flener, I supervise the PhD student Frej Knutar Lewander. I also co-supervise Yi Zhao together with Di Yuan. My recently graduated PhD students include Gustav Björdal thesis, Maria Andreina Francisco Rodriguez, thesis, and Joseph Scott, thesis. Also Ghafour Ahani who I co-supervised with Di Yuan successfully defended his thesis.

My research interests include: Constraint Programming, Optimisation, Complexity theory, Software Testing, and Artificial Intelligence including Machine Learning. I am currently teaching Algorithms and Data Structures II (1DL231) and Introduction to Machine Learning for Bachelor Students (1DL034).

I am currently responsible for coordinating the IT department’s mentor programme for new employees.

  1. A docent is an academic title in Sweden and roughly corresponds to a reader in the British system. ↩︎

Teaching

Current Courses

  • Algorithms and Data Structures II (1DL231) Homepage

Other courses not running at the moment

For more information about the other courses I teach then please visit the teaching page.

Recent Publications

Please note that the bibtex entries might have got mangled in the translation. Please see the our research group’s github repository that contains all the bibtex entries and many more. Please feel free to use the repository yourself.

Barnaby Martin, Justin Pearson (2022). When bounds consistency implies domain consistency for regular counting constraints. Constraints.

PDF Cite DOI

Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey, Guido Tack (2020). Solving satisfaction problems using large-neighbourhood search. CP 2020.

PDF Cite DOI

Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey (2019). Exploring declarative local-search neighbourhoods with constraint programming. CP 2019.

PDF Cite DOI

Gustav Björdal, Pierre Flener, Justin Pearson (2019). Generating compound moves in local search by hybridisation with complete search. CP-AI-OR 2019.

PDF Cite DOI

Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey, Guido Tack (2018). Declarative local-search neighbourhoods in Mini­Zinc. ICTAI 2018.

PDF Cite DOI

See all publications

Recent Posts

Links to CP Solvers
Links to various repositories of some maybe less well known constraint solvers. This is mainly so that I can find them again. A C++ version minicpp of MiniCP developed by Laurent Michel and his students.
Jun 14, 2023
Hugo: Linking to the static directory
I don’t know why this is so difficult. Hugo provides a static directory where you can put stuff that is directly copied to your web directory. In theory you can have links [A link]("/file.
Dec 13, 2022
Setting up Python notebooks locally for Machine Learning
This is mainly for students on my machine learning course. I use a lot of Python notebooks either for examples from lectures or for assignments. While there are many options for hosting python notebooks for free remotely, but I prefer to do things locally.
Jan 28, 2022 HowTo, Teaching
Hugo resolving output format errors.
Hugo problems output format errors.
Nov 30, 2021 HowTo
Hugo Apostrophes
How to deal with apostrophes in Hugo/Hugo Academic
Sep 10, 2021 HowTo
See all posts

Contact Me

  • justin.pearson@it.uu.se
  • +46 18 471 72 92
  • Uppsala University, Department of IT, Attention Justin Pearson, Uppsala, SE-751-05
  • My physical address is: Department of Information Technology, Ångström Hus 10, Lägerhyddsvägen 1, Uppsala. I am in room 105122.