| Linear equation systems and the search for a logical characterisation of polynomial time W Pakusa Dissertation, RWTH Aachen, 2015, 2015 | 30 | 2015 |
| Choiceless Polynomial Time on structures with small Abelian colour classes F Abu Zaid, E Grädel, M Grohe, W Pakusa Mathematical Foundations of Computer Science 2014: 39th International …, 2014 | 26 | 2014 |
| Approximations of isomorphism and logics with linear-algebraic operators A Dawar, E Grädel, W Pakusa arXiv preprint arXiv:1902.06648, 2019 | 24 | 2019 |
| Definability of linear equation systems over groups and rings A Dawar, E Kopczynski, B Holm, E Grädel, W Pakusa Logical Methods in Computer Science 9, 2013 | 22 | 2013 |
| Rank logic is dead, long live rank logic! E Grädel, W Pakusa The Journal of Symbolic Logic 84 (1), 54-87, 2019 | 21 | 2019 |
| Rank logic is dead, long live rank logic! E Grädel, W Pakusa arXiv preprint arXiv:1503.05423, 2015 | 21 | 2015 |
| A finite-model-theoretic view on propositional proof complexity E Grädel, M Grohe, B Pago, W Pakusa Logical Methods in Computer Science 15, 2022 | 20 | 2022 |
| Characterising choiceless polynomial time with first-order interpretations E Grädel, W Pakusa, S Schalthöfer, L Kaiser 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 677-688, 2015 | 18 | 2015 |
| Definability of Cai-Fürer-Immerman problems in choiceless polynomial time W Pakusa, S Schalthöfer, E Selman ACM Transactions on Computational Logic (TOCL) 19 (2), 1-27, 2018 | 12 | 2018 |
| Descriptive complexity of linear equation systems and applications to propositional proof complexity M Grohe, W Pakusa 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 11 | 2017 |
| Model-Theoretic Properties of ω-Automatic Structures FA Zaid, E Grädel, Ł Kaiser, W Pakusa Theory of Computing Systems 55, 856-880, 2014 | 11 | 2014 |
| Temporal constraint satisfaction problems in fixed-point logic M Bodirsky, W Pakusa, J Rydval Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 10 | 2020 |
| Definability of summation problems for abelian groups and semigroups FA Zaid, A Dawar, E Grädel, W Pakusa 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-11, 2017 | 5 | 2017 |
| Finite model theory with operators from linear algebra W Pakusa Staatsexamensarbeit, RWTH Aachen University, 2010 | 4 | 2010 |
| 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) A Dawar, D Kozen, S Ronchi Della Rocca, M Abadi, C Carapelle, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2015 | 3 | 2015 |
| Defining winning strategies in fixed-point logic F Canavoi, E Grädel, S Leßenich, W Pakusa 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 366-377, 2015 | 2 | 2015 |
| 26th EACSL Annual Conference on Computer Science Logic (CSL 2017) A Dawar, D Leivant, PG Kolaitis, L Kovács, S Kreutzer, M Mahajan, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | 1 | 2017 |
| The model-theoretic expressiveness of propositional proof systems E Grädel, B Pago, W Pakusa 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), 2017 | 1 | 2017 |
| LTCS–Report M Bodirsky, W Pakusa, J Rydval | | 2020 |
| 3.15 Rank Logic and Choiceless Polynomial Time W Pakusa Finite and Algorithmic Model Theory, 14, 2018 | | 2018 |
