Starten Sie Ihre Suche...


Wir weisen darauf hin, dass wir technisch notwendige Cookies verwenden. Weitere Informationen

Prof. Dr. Wied Pakusa

FB Mathematik, Informatik, Technik, Hochschule Koblenz

Joseph-Rovan-Allee 2, 53424 Remagen
  • 02642/932-379
Publikationen
Ergebnisse pro Seite:  10

Schwanen, Christopher T.; Pakusa, Wied

On Free Choice and Wil(l): From Petri Net Theory to Process Mining

Mining a Scientist's Process. Springer 2026 S. 298 - 311


Schwanen, Christopher T.; Pakusa, Wied; van der Aalst, Wil M.P.

Alignments meet Linear Algebra

Algorithms & Theories for the Analysis of Event Data 2025. Joint Workshop Proceedings of PNSE, ATAED, and PeNGE at PETRI NETS. 2025


Schwanen, Christopher T.; Pakusa, Wied; van der Aalst, Wil M.P.

Complexity of Alignments on Sound Free-Choice Workflow Nets

Application and Theory of Petri Nets and Concurrency. Springer 2025 S. 388 - 410


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