Albert Atserias

Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity.

Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems. His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena.

The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries, the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research.

Among his notable scientific awards are the prestigious ICREA Acadèmia, the PODS 2024 Best Paper Award, the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper. These accolades reflect both the excellence of his early work and his continued leadership in the field.

Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community.

He is a core member of the ALBCOM research group, a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.