Wied Pakusa
Professor of Artificial Intelligence at University of Applied Sciences Koblenz.

Prof. Dr. Wied Pakusa
I studied Computer Science and Mathematics at RWTH University. The area of Logic in Computer Science caught my special attention and in 2011, I started as a PhD student in the group of Erich Grädel. My research was centered around the main open question of Finite Model Theory: can efficient computability be expressed with a machine model that operates directly on graphs instead of their string representations? In 2015, I successfully defended my PhD thesis Linear Equation Systems and the Search for a Logical Characterisation of Polynomial Time.
As a postdoc, my interest shifted towards the area of Propositional Proof Complexity. I was awarded a DFG Research Fellowship, and spent 18 months in the group of Luke Ong at the University of Oxford. I also worked closely together with Anuj Dawar who hosted several stays at the University of Cambridge.
From 2018 to 2022, I worked as a technical expert at the Federal Office for Information Security (BSI) where I first got into contact with Process Mining, an active research area that studies data-driven techniques for process analysis. In September 2022, I was appointed as Professor of Computer Science in the department Digital Administration and Cyber Security (DACS) at HS Bund, Brühl, Germany. In March 2025, I moved to University of Applied Sciences Koblenz where I was newly appointed as Professor of Artificial Intelligence at the Faculty of Mathematics, Informatics and Technology.
My teaching and research activities are focussed on:
- Process Mining
- Artificial Intelligence
- Theoretical Computer Science
news
Mar 17, 2025 | Our new article Complexity of Alignments on Sound Free-Choice Workflow Nets was accepted at Petri Nets 2025. This is joint work with Christopher Schwanen and Wil van der Aalst. |
---|---|
Mar 01, 2025 | I was newly appointed as Professor for Artificial Intelligence at University of Applied Sciences Koblenz. |
Sep 13, 2024 | Our new article A Dynamic Programming Approach for Alignments on Process Trees was accepted at PQMI 2024. This is joint work with Christopher Schwanen and Wil van der Aalst. |