Our People

Dr Lázaro Alberto Larrauri

Junior Research Fellow

Senior Research Associate, University of Computer Science

Associate Professor (Chalmers University of Technology);  PhD (Chalmers University of Technology);  MSc (Chalmers University of Technology) 

Alberto is a Senior Research Associate in Algorithms and Complexity Theory at the Department of Computer Science. His current research the computational complexity of approximations of Constraint Satisfaction Problems. More concretely, his research focuses on Promise Constraint Satisfaction Problems (PCSPs), which can be seen as generalizations of the Approximate Graph Colouring Problem. Tools from other areas of mathematics and computer science often come into play in the study of PCSPs, such as universal algebra, combinatorics or logic. Alberto is funded by the ERC Consolidator Grant New Approaches to Approximability of Satisfiable Problems, led by Standa Živný. 

Previously, Alberto was a PhD student in the program of Applied Mathematics at Barcelona Tech, under the supervision of Marc Noy. The topic of his thesis was the asymptotic study of random structures through the lens of first order logic. He has also worked as a research assistant in the Systematic Construction of Correct Systems (SCOS) group led by Roderick Bloem at the Technical University of Graz.