Short CV/Education and training

  • Since 2021
    Assistant Professor, Department of Computer Science LTH at Lund University

  • 2021
    Research fellow, Simons Institute for the Theory of Computing, University of California, Berkeley

  • 2019 – 2021
    Postdoc, Institute of Mathematics of the Czech Academy of Sciences, Prague, Czech Republic

  • 2018
    Research fellow, Simons Institute for the Theory of Computing, University of California, Berkeley

  • 2014 – 2019
    PhD student, KTH Royal Institute of Technology in Stockholm, Sweden

  • 2012 – 2014
    MSc student, Institute of Mathematics and Statistics at the University of São Paulo, Brazil

  • 2008 – 2011
    BSc student, Institute of Mathematics and Statistics at the University of São Paulo, Brazil

Selected publications

  • Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, and Dmitry Sokolov. Automating Algebraic Proof Systems Is NP-Hard. In Proceedings of the 53rd Annual ACM Symposium on Theory of Computing (STOC '21), June 2021.

  • Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, and Robert Robere. KRW Composition Theorems via Lifting. In Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20), November 2020.

  • Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, and Marc Vinyals. Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. In Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20), November 2020.

  • Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Jakob Nordström, Massimo Lauria, and Alexander Razborov. Clique Is Hard on Average for Regular Resolution. Journal of the ACM, volume 68, issue 4, article 23, pages 1-26, June 2021. Preliminary version in STOC '18.

  • Susanna F. de Rezende, Jakob Nordström, and Marc Vinyals. How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). In Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS '16), October 2016.



Complete list of publications

Selected projects

  • VR Project Grant: Efficient proofs and circuits: a unified approach. Funded by the Swedish Research Council (VR), 2022 – 2025

  • KAW Postdoc Grant: The complexity of proving (hard) theorems. Funded by Knut and Alice Wallenberg Foundation (KAW), 2019 – 2021

Soft Skills/Other activities and achievements

Other activities and achievements/family

  • PC member of STOC ’23, FOCS ’21, CSR ’21, IJCAI ’21

  • Co-organiser of the proof complexity workshop at FOCS ’21, February 2022

  • Local organizer of Future Digileaders, Stockholm, November 2019

  • Main organizer of the Rising Stars at KTH workshop, April 2019


Contact

You can only see the contact information of the academics in the database if you are a registered user of AcademiaNet.
Please register here

Testimonials

  1. Read what our members say about AcademiaNet.

Follow us

Similar profiles

  1. Prof. Dr. Ilka Agricola

    Mathematics and statistics, Differential geometry and global analysis

  2. Dr. Maria Anisimova

    Biological and related sciences, Education, Information and Communication Technologies (ICTs), Mathematics and statistics, Bioinformatics, Computational genomics and modeling Molecular evolution

  3. Prof. Dr. Karin Baur

    Mathematics and statistics, Algebra, Representation Theory

  4. Prof. Dr. Christine Alewell

    Environment, Mathematics and statistics, biogeochemistry, isotope geochemistry, soil science

 
 
Academia Net