Prof. Dr. Wied Pakusa
FB Mathematik, Informatik, Technik, Hochschule Koblenz
- 02642/932-379
Pakusa, Wied; Schwanen, Christopher T.; van der Aalst, Wil M. P.
A Dynamic Programming Approach for Alignments on Process TreesDelgado, Andrea; Slaats, Tijs (Hrsg). Process Mining Workshops. Lyngby: Springer 2024 S. 84 - 97 (ICPM 2024 International Workshops)
Pakusa, Wied; Schwanen, Christopher T.; van der Aalst, Wil M. P.
Process Tree AlignmentsBorbinha, Jose; Sales, Tiago Prince; Da Silva, Miguel Mira; (Hrsg). Enterprise Design, Operations, and Computing- 28th International Conference. Vienna, Austria: Springer 2024 S. 300 - 317 (Revised Selected Papers)
Pakusa, Wied; Bodirsky, Manuel; Rydval, Jakub
Temporal Constraint Satisfaction Problems in Fixed-Point LogicLICS ’20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Hrsg). Saarbrücken. 2020
Pakusa, Wied; Grädel, Erich; Grohe, Martin et al.
A Finite-Model-Theoretic View on Propositional Proof ComplexityLogical Methods in Computer Science. Bd. 15. H. 1. 2019
Pakusa, Wied; Dawar, Anuj; Grädel, Erich
Approximations of Isomorphism and Logics with Linear-Algebraic Operators46th International Colloquium on Automata, Languages, and Programming. Dagstuhl. 2019 S. 112 - 113 (Leibniz International Proceedings in Informatics)
Pakusa, Wied; Grädel, Erich
Rank logic is dead, long live rank logic!The Journal of symbolic logic. Bd. 84. H. 1. Association of Symbolic Logic 2019 S. 54 - 87
Pakusa, Wied; Zaid, Faried Abu; Dawar, Anuj et al.
Definability of Summation Problems for Abelian Groups and SemigroupsProceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science. 2017 S. 1 - 4
Pakusa, Wied; Grohe, Martin
Descriptive Complexity of Linear Equation Systems and Applications to Propositional Proof ComplexityProceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science. 2017
Pakusa, Wied; Grädel, Erich; Pago, Benedikt
The Model-Theoretic Expressiveness of Propositional Proof SystemsIn 26th EACSL Annual Conference on Computer Science Logic. 2017
Pakusa, Wied; Schalthöfer, Svenja; Selman, Erkal
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial TimeTalbot, Jean-Marc; Regnier, Laurent (Hrsg). 25th EACSL Annual Conference on Computer Science Logic. Dagstuhl. 2016 S. 1 - 17 (Leibniz International Proceedings in Informatics)