Susanna de Rezende

Susanna de Rezende is an Assistant Professor in the Department of Computer Science at Lund University (LTH). She is affiliated with the ELLIIT initiative on IT and mobile communication, the LTH Profile Area: AI and Digitalization, and the MIAO group collaborating with the University of Copenhagen. Her research focuses on computational complexity, proof complexity, circuit complexity, and communication complexity. She holds a PhD from KTH Royal Institute of Technology (2019) and a Master's from the University of São Paulo (2014).

Her research explores connections between proof systems, circuit lower bounds, and communication complexity, with recent contributions to lifting theorems, automatability, and average-case hardness. She has received awards including the Stockholm Mathematics Centre Prize and Wallenberg Academy Fellow status. Current projects include funded PhD positions in theoretical computer science and editorial work for ZML: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik.

Key articles address proof complexity trade-offs, clique hardness in Sherali-Adams, and graph coloring challenges. Collaborations span institutions like the Czech Academy of Sciences and the Simons Institute. She advises multiple PhD students and collaborates on foundational research in complexity theory, supported by WASP, ELLIIT, and VR grants.