| 2026 | ICDT | Gamma Acyclicity, Annotated Relations, and Consistency Witness Functions. | Albert Atserias, Phokion G. Kolaitis |
| 2025 | FOCS | The Proof Analysis Problem. | Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki |
| 2025 | PODS | Local-vs-Global Consistency of Annotated Relations. | Albert Atserias |
| 2025 | STOC | Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets. | Albert Atserias, Iddo Tzameret |
| 2025 | STACS | Proof Complexity and Its Relations to SAT Solving (Invited Talk). | Albert Atserias |
| 2023 | STOC | On the Consistency of Circuit Lower Bounds for Non-deterministic Time. | Albert Atserias, Sam Buss, Moritz Mller |
| 2022 | ICALP | Towards a Theory of Algorithmic Proof Complexity (Invited Talk). | Albert Atserias |
| 2022 | SODA | Promise Constraint Satisfaction and Width. | Albert Atserias, Vctor Dalmau |
| 2021 | LICS | On the Expressive Power of Homomorphism Counts. | Albert Atserias, Phokion G. Kolaitis, Wei-Lin Wu |
| 2021 | PODS | Structure and Complexity of Bag Consistency. | Albert Atserias, Phokion G. Kolaitis |
| 2019 | FOCS | Automating Resolution is NP-Hard. | Albert Atserias, Moritz Mller |
| 2019 | LICS | On the Power of Symmetric Linear Programs. | Albert Atserias, Anuj Dawar, Joanna Ochremiak |
| 2019 | SAT | Circular (Yet Sound) Proofs. | Albert Atserias, Massimo Lauria |
| 2018 | CSL | Definable Inapproximability: New Challenges for Duplicator. | Albert Atserias, Anuj Dawar |
| 2018 | ICALP | On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface. | Albert Atserias, Stephan Kreutzer, Marc Noy |
| 2018 | LICS | Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem. | Albert Atserias, Joanna Ochremiak |
| 2018 | STOC | Clique is hard on average for regular resolution. | Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordstrm, Alexander A. Razborov |
| 2017 | FCT | Generalized Satisfiability Problems via Operator Assignments. | Albert Atserias, Phokion G. Kolaitis, Simone Severini |
| 2017 | ICALP | Proof Complexity Meets Algebra. | Albert Atserias, Joanna Ochremiak |
| 2016 | CSL | Non-Homogenizable Classes of Finite Structures. | Albert Atserias, Szymon Torunczyk |
| 2015 | LICS | Entailment among Probabilistic Implications. | Albert Atserias, Jos L. Balczar |
| 2013 | STACS | Bounded-width QBF is PSPACE-complete. | Albert Atserias, Sergi Oliva |
| 2013 | SAT | The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs. | Albert Atserias |
| 2012 | ICALP | Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. | Albert Atserias, Anuj Dawar |
| 2011 | LICS | A Why-on-Earth Tutorial on Finite Model Theory. | Albert Atserias |
| 2010 | ICALP | Mean-Payoff Games and Propositional Proofs. | Albert Atserias, Elitza N. Maneva |
| 2009 | CSL | Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. | Albert Atserias, Mark Weyer |
| 2009 | MFCS | Four Subareas of the Theory of Constraints, and Their Links. | Albert Atserias |
| 2009 | SAT | Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. | Albert Atserias, Johannes Klaus Fichte, Marc Thurley |
| 2008 | FOCS | Size Bounds and Query Plans for Relational Joins. | Albert Atserias, Martin Grohe, Dniel Marx |
| 2007 | ICALP | On the Power of | Albert Atserias, Andrei A. Bulatov, Vctor Dalmau |
| 2007 | ICALP | Affine Systems of Equations and Counting Infinitary Logic. | Albert Atserias, Andrei A. Bulatov, Anuj Dawar |
| 2005 | ICALP | Preservation Under Extensions on Well-Behaved Finite Structures. | Albert Atserias, Anuj Dawar, Martin Grohe |
| 2005 | ICDT | Conjunctive Query Evaluation by Search Tree Revisited. | Albert Atserias |
| 2005 | LICS | On Digraph Coloring Problems and Treewidth Duality. | Albert Atserias |
| 2005 | LICS | Definability on a Random 3-CNF Formula. | Albert Atserias |
| 2004 | CP | Constraint Propagation as a Proof System. | Albert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi |
| 2004 | CSL | Notions of Average-Case Complexity for Random 3-SAT. | Albert Atserias |
| 2004 | PODS | On Preservation under Homomorphisms and Unions of Conjunctive Queries. | Albert Atserias, Anuj Dawar, Phokion G. Kolaitis |
| 2002 | CSL | On the Automatizability of Resolution and Related Propositional Proof Systems. | Albert Atserias, Maria Luisa Bonet |
| 2002 | LICS | Unsatisfiable Random Formulas Are Hard to Certify. | Albert Atserias |
| 2001 | ICALP | Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. | Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban |
| 2001 | MFCS | Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms. | Albert Atserias |
| 2000 | CSL | The Descriptive Comlexity of the Fixed-Points of Bounded Formulas. | Albert Atserias |
| 2000 | ICALP | Monotone Proofs of the Pigeon Hole Principle. | Albert Atserias, Nicola Galesi, Ricard Gavald |
| 1999 | LICS | First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. | Albert Atserias, Phokion G. Kolaitis |