Wied Pakusa

According to our database1, Wied Pakusa authored at least 13 papers between 2013 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Temporal Constraint Satisfaction Problems in Fixed-Point Logic.
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.
Log. Methods Comput. Sci., 2019

Rank Logic is dead, Long Live Rank Logic!
J. Symb. Log., 2019

Approximations of Isomorphism and Logics with Linear-Algebraic Operators.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time.
ACM Trans. Comput. Log., 2018

2017
Definability of summation problems for Abelian groups and semigroups.
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.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

The Model-Theoretic Expressiveness of Propositional Proof Systems.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2015
Characterising Choiceless Polynomial Time with First-Order Interpretations.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Defining Winning Strategies in Fixed-Point Logic.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Model-Theoretic Properties of ω-Automatic Structures.
Theory Comput. Syst., 2014

Choiceless Polynomial Time on Structures with Small Abelian Colour Classes.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Definability of linear equation systems over groups and rings
Log. Methods Comput. Sci., 2013


  Loading...