| No. |
Title |
Author |
Year |
| 1 |
Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051) |
Atserias, Albert et al. |
2022 |
| 2 |
Towards a Theory of Algorithmic Proof Complexity (Invited Talk) |
Atserias, Albert |
2022 |
| 3 |
Proofs of Soundness and Proof Search (Invited Talk) |
Atserias, Albert |
2020 |
| 4 |
Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs |
Atserias, Albert et al. |
2019 |
| 5 |
Definable Inapproximability: New Challenges for Duplicator |
Atserias, Albert et al. |
2018 |
| 6 |
On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface |
Atserias, Albert et al. |
2018 |
| 7 |
Proof Complexity (Dagstuhl Seminar 18051) |
Atserias, Albert et al. |
2018 |
| 8 |
Proof Complexity Meets Algebra |
Atserias, Albert et al. |
2017 |
| 9 |
Non-Homogenizable Classes of Finite Structures |
Atserias, Albert et al. |
2016 |
| 10 |
Bounded-width QBF is PSPACE-complete |
Atserias, Albert et al. |
2013 |
