Susanna de Rezende

Postdoctoral Researcher, Czech Academy of Sciences

Susanna de Rezende works on computational complexity with primary focus on proof complexity. She is currently a Postdoctoral Researcher at the Institute of Mathematics of the Czech Academy of Sciences, Prague, Czech Republic, hosted by Pavel Pudlák with a grant from the Knut and Alice Wallenberg Foundation. Prior to that Susanna was a PhD student of Jakob Nordström in the Theoretical Computer Science Group at KTH Royal Institute of Technology in Stockholm, Sweden. She received the Stockholm Mathematics Centre Prize for Excellent Doctoral Dissertation 2018/2019. In 2018, Susanna was a Research Fellow in the Lower Bounds in Computational Complexity Program at the Simons Institute, University of California, Berkeley, USA. During her Master's studies, she worked on graph theory under the supervision of Yoshiko Wakabayashi at the Institute of Mathematics and Statistics at University of Săo Paulo, Brazil.

Program Visits

Meta-Complexity, Spring 2023, Visiting Scientist
Extended Reunion: Satisfiability, Spring 2023, Visiting Scientist
Satisfiability: Theory, Practice, and Beyond, Spring 2021, Research Fellow
Lower Bounds in Computational Complexity, Fall 2018, Google Research Fellow