CAS / IM / MLTCS / Susanna F. de Rezende

Susanna F. de Rezende

Credit: Annie Raymond


I work on computational complexity, with primary focus on proof complexity. I am currently a postdoc at the Institute of Mathematics of the Czech Academy of Sciences, Prague, Czech Republic, hosted by Prof. Pavel Pudlák with a grant from the Knut and Alice Wallenberg Foundation.

Prior to that I was a PhD student of Prof. Jakob Nordström in the Theoretical Computer Science Group at KTH Royal Institute of Technology in Stockholm, Sweden. I received the Stockholm Mathematics Centre Prize for Excellent Doctoral Dissertation 2018/2019.

I was a research fellow at the Simons Institute for the Theory of Computing, University of California, Berkeley for the Satisfiability: Theory, Practice and Beyond Program in 2021 and for the Lower Bounds in Computational Complexity Program in 2018.

During my Master's studies, I worked on graph theory under the supervision of Prof. Yoshiko Wakabayashi at the Institute of Mathematics and Statistics at the University of São Paulo, Brazil.

My cv: PDF (updated June 2021)

Contact Info

Email: rezende at math dot cas dot cz

Phone: +420-222 090 768

Postal address: Institute of Mathematics AS CR, Žitná 25, 115 67 Praha 1, Czech Republic




Main organizer of the workshop Rising Stars at KTH 2019.
Published by: Susanna F. de Rezende <rezende~at~math~dot~cas~dot~cz>
Updated 2021-06-26