Full Professor at the Computer Science Department of UPC (Oct 2018 - today)

Associate Professor at the Computer Science Department of UPC (Apr 2005 – Sep 2018).

Lecturer at the Computer Science Department of UPC (Mar 2002- Mar 2005).

Visiting research positions held: Postdoctoral Fellowship at Charles University, Prague (Jul 2006), Program Participant at Isaac Newton Institute for the Mathematical Sciences, Cambridge (Jan-Feb 2007, Jan-Feb 2012), Visiting Scholarship at University of California, Berkeley (Jan-Jun 2008).

Principal Investigator of an ERC Consolidator Grant 2015 – 2020.

• Theory of computation
• Combinatorics
• Mathematical logic
• Mathematical programming

• A. Atserias, I. Bonacina, S. F. de Rezende, M. Lauria, J. Nordström, and A. A. Razborov. Clique Is Hard on Average for Regular Resolution, Journal of the ACM, 68(4), Article No. 23, 2021.
• A. Atserias, A. Dawar, and J. Ochremiak. On the Power of Symmetric Linear Programs, Journal of the ACM, 68(4), Article No. 26, 2021.
• A. Atserias and M. Müller. Automating Resolution is NP-Hard, Journal of the ACM, 67(5), Article No. 31, 2020.
• A. Atserias, M. Grohe, and D. Marx. Size bounds and query plans for relational joins, SIAM Journal on Computing, 42(4), pages 1737-1767, 2013.
• A. Atserias and E. Maneva. Sherali-Adams Relaxations and Indistinguishability in Counting Logics, SIAM Journal on Computing, 42(1), pages 112-137, 2013.
• A. Atserias and V. Dalmau. A Combinatorial Characterization of Resolution Width, Journal of Computer and System Sciences, 74(3), pages 323-334, 2008.
• A. Atserias, A. Dawar, and Ph. G. Kolaitis. On Preservation under Homomorphisms and Unions of Conjunctive Queries, Journal of the ACM, 53(2), pages 208-237, 2006.
• A. Atserias. On Sufficient Conditions for Unsatisfiability of Random Formulas, Journal of the ACM, 51(2), pages 281-311, 2004.