publications

2024

1. Process Tree Alignments

   Christopher T. Schwanen, Wied Pakusa, and Wil M. P. Aalst

   In Enterprise Design, Operations, and Computing - 28th International Conference, EDOC 2024, Vienna, Austria, September 10-13, 2024, Revised Selected Papers, 2024

   Bib PDF

   @inproceedings{SchwanenPA24,
     author = {Schwanen, Christopher T. and Pakusa, Wied and van der Aalst, Wil M. P.},
     editor = {Borbinha, Jos{\'{e}} and Sales, Tiago Prince and da Silva, Miguel Mira and Proper, Henderik A. and Schnellmann, Marianne},
     title = {Process Tree Alignments},
     booktitle = {Enterprise Design, Operations, and Computing - 28th International
                       Conference, {EDOC} 2024, Vienna, Austria, September 10-13, 2024, Revised
                       Selected Papers},
     series = {Lecture Notes in Computer Science},
     volume = {15409},
     pages = {300--317},
     publisher = {Springer},
     year = {2024},
     url = {https://doi.org/10.1007/978-3-031-78338-8\_16},
     doi = {10.1007/978-3-031-78338-8\_16},
   }

2020

1. Temporal Constraint Satisfaction Problems in Fixed-Point Logic

   Manuel Bodirsky, Wied Pakusa, and Jakub Rydval

   In LICS ’20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020, 2020

   Bib PDF

   @inproceedings{BodirskyPR20,
     author = {Bodirsky, Manuel and Pakusa, Wied and Rydval, Jakub},
     editor = {Hermanns, Holger and Zhang, Lijun and Kobayashi, Naoki and Miller, Dale},
     title = {Temporal Constraint Satisfaction Problems in Fixed-Point Logic},
     booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer
                       Science, Saarbr{\"{u}}cken, Germany, July 8-11, 2020},
     pages = {237--251},
     publisher = {{ACM}},
     year = {2020},
     url = {https://doi.org/10.1145/3373718.3394750},
     doi = {10.1145/3373718.3394750},
   }

2019

1. Approximations of Isomorphism and Logics with Linear-Algebraic Operators

   Anuj Dawar, Erich Grädel, and Wied Pakusa

   In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019

   arXiv Bib PDF

   @inproceedings{DawarGP19,
     author = {Dawar, Anuj and Gr{\"a}del, Erich and Pakusa, Wied},
     title = {{Approximations of Isomorphism and Logics with Linear-Algebraic Operators}},
     booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
     pages = {112:1--112:14},
     series = {Leibniz International Proceedings in Informatics (LIPIcs)},
     isbn = {978-3-95977-109-2},
     issn = {1868-8969},
     year = {2019},
     volume = {132},
     editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
     publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
     address = {Dagstuhl, Germany},
     url = {http://drops.dagstuhl.de/opus/volltexte/2019/10688},
     urn = {urn:nbn:de:0030-drops-106887},
     doi = {10.4230/LIPIcs.ICALP.2019.112},
     annote = {Keywords: Finite Model Theory, Graph Isomorphism, Descriptive Complexity, Algebra}
   }

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

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

   Logical Methods in Computer Science, Jan 2019

   arXiv Bib PDF

   @article{GraedelGPP19,
     title = {{A Finite-Model-Theoretic View on Propositional Proof Complexity}},
     author = {Gr{\"a}del, Erich and Grohe, Martin and Pago, Benedikt and Pakusa, Wied},
     url = {https://lmcs.episciences.org/5119},
     doi = {https://doi.org/10.23638/LMCS-15(1:4)2019},
     journal = {{Logical Methods in Computer Science}},
     volume = {{Volume 15, Issue 1}},
     year = {2019},
     month = jan
   }

3. Rank logic is dead, long live rank logic!

   Erich Grädel, and Wied Pakusa

   The Journal of Symbolic Logic, Mar 2019

   Bib PDF

   @article{GraedelP19,
     title = {{Rank logic is dead, long live rank logic!}},
     author = {Gr{\"a}del, Erich and Pakusa, Wied},
     url = {https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/rank-logic-is-dead-long-live-rank-logic/F161E336281F2B67E8B3E4CDA5614933},
     doi = {{10.1017/jsl.2018.33}},
     journal = {The Journal of Symbolic Logic},
     volume = {84},
     number = {1},
     publisher = {Cambridge University Press},
     year = {2019},
     month = mar,
   }

2017

1. Definability of Summation Problems for Abelian Groups and Semigroups

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

   In Proceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Mar 2017

   Bib PDF

   @inproceedings{AbuZaidDGP17,
     author = {{Abu Zaid}, Faried and Dawar, Anuj and Gr{\"a}del, Erich and Pakusa, Wied},
     title = {{Definability of Summation Problems for Abelian Groups and Semigroups}},
     url = {https://ieeexplore.ieee.org/document/8005082},
     booktitle = {{Proceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)}},
     year = {2017},
   }

2. Descriptive Complexity of Linear Equation Systems and Applications to Propositional Proof Complexity

   Martin Grohe, and Wied Pakusa

   In Proceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Mar 2017

   Bib PDF

   @inproceedings{GroheP17,
     author = {Grohe, Martin and Pakusa, Wied},
     title = {{Descriptive Complexity of Linear Equation Systems and Applications to Propositional Proof Complexity}},
     url = {https://ieeexplore.ieee.org/document/8005081},
     booktitle = {{Proceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)}},
     year = {2017},
   }

3. The Model-Theoretic Expressiveness of Propositional Proof Systems

   Erich Grädel, Benedikt Pago, and Wied Pakusa

   In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), Mar 2017

   Bib PDF

   @inproceedings{GraedelPP17,
     author = {Gr{\"a}del, Erich and Pago, Benedikt and Pakusa, Wied},
     title = {{The Model-Theoretic Expressiveness of Propositional Proof Systems}},
     url = {https://doi.org/10.4230/LIPIcs.CSL.2017.27},
     booktitle = {{26th EACSL Annual Conference on Computer Science Logic (CSL 2017)}},
     year = {2017},
   }

2016

1. Linear Equation Systems and the Search for a Logical Characterisation of Polynomial Time

   Wied Pakusa

   RWTH Aachen University, Mar 2016

   Bib PDF

   @phdthesis{Pakusa16,
     author = {Pakusa, Wied},
     school = {{RWTH} Aachen University},
     title = {Linear Equation Systems and the Search for a Logical Characterisation of Polynomial Time},
     url = {http://publications.rwth-aachen.de/record/567588/files/567588.pdf?subformat=pdfa},
     year = {2016},
   }

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

   Wied Pakusa, Svenja Schalthöfer, and Erkal Selman

   In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), Mar 2016

   Bib PDF

   @inproceedings{PakusaSS16,
     author = {Pakusa, Wied and Schalth{\"o}fer, Svenja and Selman, Erkal},
     title = {{Definability of Cai-F\"urer-Immerman Problems in Choiceless Polynomial Time}},
     booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
     pages = {19:1--19:17},
     series = {Leibniz International Proceedings in Informatics (LIPIcs)},
     isbn = {978-3-95977-022-4},
     issn = {1868-8969},
     year = {2016},
     volume = {62},
     editor = {Talbot, Jean-Marc and Regnier, Laurent},
     publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
     address = {Dagstuhl, Germany},
     url = {https://doi.org/10.4230/LIPIcs.CSL.2016.19},
     urn = {urn:nbn:de:0030-drops-65595},
     doi = {http://dx.doi.org/10.4230/LIPIcs.CSL.2016.19},
   }

2015

1. Defining Winning Strategies in Fixed-Point Logic

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

   In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, Mar 2015

   Bib PDF

   @inproceedings{CanavoiGLP15,
     author = {Canavoi, Felix and Gr{\"{a}}del, Erich and Le{\ss}enich, Simon and Pakusa, Wied},
     title = {Defining Winning Strategies in Fixed-Point Logic},
     booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
                       2015, Kyoto, Japan, July 6-10, 2015},
     pages = {366--377},
     publisher = {{IEEE} Computer Society},
     year = {2015},
     url = {https://doi.org/10.1109/LICS.2015.42},
     doi = {10.1109/LICS.2015.42},
   }

2. Characterising Choiceless Polynomial Time with First-Order Interpretations

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

   In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, Mar 2015

   Bib PDF

   @inproceedings{GradelPSK15,
     author = {Gr{\"{a}}del, Erich and Pakusa, Wied and Schalth{\"{o}}fer, Svenja and Kaiser, Lukasz},
     title = {Characterising Choiceless Polynomial Time with First-Order Interpretations},
     booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
                       2015, Kyoto, Japan, July 6-10, 2015},
     pages = {677--688},
     publisher = {{IEEE} Computer Society},
     year = {2015},
     url = {https://doi.org/10.1109/LICS.2015.68},
     doi = {10.1109/LICS.2015.68},
   }

2014

1. Choiceless Polynomial Time on structures with small Abelian colour classes

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

   In Mathematical Foundations of Computer Science 2014, Mar 2014

   Bib PDF

   @incollection{AbuZaidGGP14,
     author = {{Abu Zaid}, Faried and Gr{\"a}del, Erich and Grohe, Martin and Pakusa, Wied},
     title = {{Choiceless Polynomial Time on structures with small Abelian colour classes}},
     url = {https://link.springer.com/chapter/10.1007/978-3-662-44522-8_5},
     year = {2014},
     booktitle = {Mathematical Foundations of Computer Science 2014},
     volume = {8634},
     series = {Lecture Notes in Computer Science},
     publisher = {Springer},
     pages = {50-62},
   }

2013

1. Model-Theoretic Properties of omega-Automatic Structures

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

   Theory of Computing Systems, Special Issue dedicated to STACS 2012, Mar 2013

   published online 17 October 2013

   Bib PDF

   @article{AbuZaidGKP13,
     author = {{Abu Zaid}, Faried and Gr{\"a}del, Erich and \L{}ukasz Kaiser and Pakusa, Wied},
     title = {Model-Theoretic Properties of omega-Automatic Structures},
     journal = {Theory of Computing Systems, Special Issue dedicated to STACS 2012},
     url = {https://link.springer.com/article/10.1007/s00224-013-9508-6},
     note = {published online 17 October 2013},
     doi = {http://dx.doi.org/10.1007/s00224-013-9508-6},
     year = {2013},
   }

2. Definability of linear equation systems over groups and rings

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

   Log. Methods Comput. Sci., Mar 2013

   Bib PDF

   @article{DawarGHKP13,
     author = {Dawar, Anuj and Gr{\"{a}}del, Erich and Holm, Bjarki and Kopczynski, Eryk and Pakusa, Wied},
     title = {Definability of linear equation systems over groups and rings},
     journal = {Log. Methods Comput. Sci.},
     volume = {9},
     number = {4},
     year = {2013},
     url = {https://doi.org/10.2168/LMCS-9(4:12)2013},
     doi = {10.2168/LMCS-9(4:12)2013},
   }

2010

1. Finite Model Theory with Operators from Linear Algebra

   Wied Pakusa

   Mar 2010

   Bib PDF

   @misc{Pa10,
     author = {{Pakusa}, Wied},
     howpublished = {Staatsexamensarbeit, RWTH-Aachen University},
     title = {{Finite Model Theory with Operators from Linear Algebra}},
     url = {https://publications.rwth-aachen.de/record/48786/export/he?ln=en},
     year = {2010},
   }