Prof. Dr. Wied Pakusa - Publikationen

Pakusa, Wied; Schwanen, Christopher T.; van der Aalst, Wil M. P.
A Dynamic Programming Approach for Alignments on Process Trees
Delgado, 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 Alignments
Borbinha, 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 Logic
LICS ’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 Complexity
Logical Methods in Computer Science. Bd. 15. H. 1. 2019

Pakusa, Wied; Dawar, Anuj; Grädel, Erich
Approximations of Isomorphism and Logics with Linear-Algebraic Operators
46th 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 Semigroups
Proceedings 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 Complexity
Proceedings 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 Systems
In 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 Time
Talbot, Jean-Marc; Regnier, Laurent (Hrsg). 25th EACSL Annual Conference on Computer Science Logic. Dagstuhl. 2016 S. 1 - 17 (Leibniz International Proceedings in Informatics)

Pakusa, Wied
Linear Equation Systems and the Search for a Logical Characterisation of Polynomial Time
RWTH Aachen (Hrsg). Aachen. 2016

Pakusa, Wied; Grädel, Erich; Schalthöfer, Svenja et al.
Characterising Choiceless Polynomial Time with First-Order Interpretations
In 30th Annual ACM/IEEE Symposium on Logic in Computer Science. 2015 S. 677 - 688

Pakusa, Wied; Canavoi, Felix; Grädel, Erich et al.
Defining Winning Strategies in Fixed-Point Logic
Computer Society (Hrsg). 30th Annual {ACM/IEEE} Symposium on Logic in Computer Science. Kyoto, Japan. 2015 S. 366 - 377

Pakusa, Wied; Zaid, Faried Abu; Grädel, Erich et al.
Choiceless Polynomial Time on structures with small Abelian colour classes
In Mathematical Foundations of Computer Science 2014. Springer 2014 S. 50 - 62

Pakusa, Wied; Dawar, Anuj; Grädel, Erich et al.
Definability of linear equation systems over groups and rings
Log. Methods Comput. Sci. Bd. 9. H. 4. 2013

Pakusa, Wied; Zaid, Faried Abu; Grädel, Erich et al.
Model-Theoretic Properties of omega-Automatic Structures
Theory of Computing Systems, Special Issue dedicated to STACS 2012. 2013

Pakusa, Wied
Finite Model Theory with Operators from Linear Algebra
Aachen. 2010