Prof. Dr. Wied Pakusa
FB Mathematik, Informatik, Technik, Hochschule Koblenz
- 02642/932-379
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)
Pakusa, Wied
Linear Equation Systems and the Search for a Logical Characterisation of Polynomial TimeRWTH Aachen (Hrsg). Aachen. 2016
Pakusa, Wied; Grädel, Erich; Schalthöfer, Svenja et al.
Characterising Choiceless Polynomial Time with First-Order InterpretationsIn 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 LogicComputer 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 classesIn Mathematical Foundations of Computer Science 2014. Springer 2014 S. 50 - 62