Wied Pakusa

25 papers A* 6B 6Journal 10Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Computational Complexity of Alignments.
CoRR
Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst
2025 — conf
Alignments meet Linear Algebra.
PNSE/ATAED/PeNGE@PETRI NETS
Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst
2025 B conf
Complexity of Alignments on Sound Free-Choice Workflow Nets.
Petri Nets
Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst
2024 — conf
A Dynamic Programming Approach for Alignments on Process Trees.
ICPM Workshops
Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst
2024 B conf
Process Tree Alignments.
EDOC
Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst
2020 A* conf
Temporal Constraint Satisfaction Problems in Fixed-Point Logic.
LICS
Manuel Bodirsky, Wied Pakusa, Jakub Rydval
2020 J jnl
Temporal Constraint Satisfaction Problems in Fixed-Point Logic.
CoRR
Manuel Bodirsky, Wied Pakusa, Jakub Rydval
2019 J jnl
A Finite-Model-Theoretic View on Propositional Proof Complexity.
Log. Methods Comput. Sci.
Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa
2019 A* conf
Approximations of Isomorphism and Logics with Linear-Algebraic Operators.
ICALP
Anuj Dawar, Erich Grädel, Wied Pakusa
2019 J jnl
Approximations of Isomorphism and Logics with Linear-Algebraic Operators.
CoRR
Anuj Dawar, Erich Grädel, Wied Pakusa
2019 J jnl
Rank Logic is dead, Long Live Rank Logic!
J. Symb. Log.
Erich Grädel, Wied Pakusa
2018 J jnl
A Finite-Model-Theoretic View on Propositional Proof Complexity.
CoRR
Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa
2018 J jnl
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time.
ACM Trans. Comput. Log.
Wied Pakusa, Svenja Schalthöfer, Erkal Selman
2017 A* conf
Definability of summation problems for Abelian groups and semigroups.
LICS
Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa
2017 A* conf
Descriptive complexity of linear equation systems and applications to propositional proof complexity.
LICS
Martin Grohe, Wied Pakusa
2017 B conf
The Model-Theoretic Expressiveness of Propositional Proof Systems.
CSL
Erich Grädel, Benedikt Pago, Wied Pakusa
2016 B conf
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time.
CSL
Wied Pakusa, Svenja Schalthöfer, Erkal Selman
2015 A* conf
Characterising Choiceless Polynomial Time with First-Order Interpretations.
LICS
Erich Grädel, Wied Pakusa, Svenja Schalthöfer, Lukasz Kaiser
2015 A* conf
Defining Winning Strategies in Fixed-Point Logic.
LICS
Felix Canavoi, Erich Grädel, Simon Leßenich, Wied Pakusa
2015 B conf
Rank Logic is Dead, Long Live Rank Logic!.
CSL
Erich Grädel, Wied Pakusa
2015 J jnl
Rank logic is dead, long live rank logic!
CoRR
Erich Grädel, Wied Pakusa
2014 — conf
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes.
MFCS (1)
Faried Abu Zaid, Erich Grädel, Martin Grohe, Wied Pakusa
2014 J jnl
Model-Theoretic Properties of ω-Automatic Structures.
Theory Comput. Syst.
Faried Abu Zaid, Erich Grädel, Lukasz Kaiser, Wied Pakusa
2013 J jnl
Definability of linear equation systems over groups and rings
Log. Methods Comput. Sci.
Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa
2012 B conf
Definability of linear equation systems over groups and rings.
CSL
Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa