Wied Pakusa

According to our database, Wied Pakusa authored at least 20 papers between 2012 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Computational Complexity of Alignments.

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

CoRR, March, 2026

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

Christopher T. Schwanen, Wied Pakusa

Proceedings of the Mining a Scientist's Process, 2026

Coming Home for Blocking Transitions Fast.

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

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2026

2025

Alignments meet Linear Algebra.

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

Proceedings of the Joint Proceedings of the Workshops at the 46th International Conference on Application and Theory of Petri Nets and Concurrency: Petri Nets and Software Engineering (PNSE'25), Algorithms & Theories for the Analysis of Event Data (ATAED'25), and Petri Net Games, Examples and Quizzes for Education, Contest and Fun (PeNGE'25) co-located with PETRI NETS 2025, June 23, 2025

Complexity of Alignments on Sound Free-Choice Workflow Nets.

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

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2025

2024

A Dynamic Programming Approach for Alignments on Process Trees.

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

Proceedings of the Process Mining Workshops, 2024

Process Tree Alignments.

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

Proceedings of the Enterprise Design, Operations, and Computing, 2024

2020

Temporal Constraint Satisfaction Problems in Fixed-Point Logic.

Manuel Bodirsky, Wied Pakusa, Jakub Rydval

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019

A Finite-Model-Theoretic View on Propositional Proof Complexity.

Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

Log. Methods Comput. Sci., 2019

Approximations of Isomorphism and Logics with Linear-Algebraic Operators.

Anuj Dawar, Erich Grädel, Wied Pakusa

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2017

Definability of summation problems for Abelian groups and semigroups.

Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Descriptive complexity of linear equation systems and applications to propositional proof complexity.

Martin Grohe, Wied Pakusa

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

The Model-Theoretic Expressiveness of Propositional Proof Systems.

Erich Grädel, Benedikt Pago, Wied Pakusa

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time.

Wied Pakusa, Svenja Schalthöfer, Erkal Selman

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

Characterising Choiceless Polynomial Time with First-Order Interpretations.

Erich Grädel, Wied Pakusa, Svenja Schalthöfer, Lukasz Kaiser

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Defining Winning Strategies in Fixed-Point Logic.

Felix Canavoi, Erich Grädel, Simon Leßenich, Wied Pakusa

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Rank Logic is Dead, Long Live Rank Logic!.

Erich Grädel, Wied Pakusa

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Model-Theoretic Properties of ω-Automatic Structures.

Faried Abu Zaid, Erich Grädel, Lukasz Kaiser, Wied Pakusa

Theory Comput. Syst., 2014

Choiceless Polynomial Time on Structures with Small Abelian Colour Classes.

Faried Abu Zaid, Erich Grädel, Martin Grohe, Wied Pakusa

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2012

Definability of linear equation systems over groups and rings.

Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa

Proceedings of the Computer Science Logic, 2012