bild
School of
Electrical Engineering
and Computer Science
KTH / EECS / TCS / People / Susanna F. de Rezende

Susanna F. de Rezende

Credit: Annie Raymond

About

I am a graduate student in the Theoretical Computer Science Group at the School of Electrical Engineering and Computer Science (EECS) at KTH Royal Institute of Technology in Stockholm, Sweden. I am working on computational complexity, with primary focus on proof complexity, under the supervision of Prof. Jakob Nordström. Prior to this I received my Masters degree from the Institute of Mathematics and Statistics at the University of São Paulo, Brazil, where I worked on graph theory under the supervision of Prof. Yoshiko Wakabayashi.

My cv: PDF (updated August 2018)

Contact Info

Email: sfdr at kth dot se

Phone: +46 8 790 6853

Postal address: KTH EECS, Lindstedtsvägen 3, 100 44 Stockholm, Sweden

Office: Osquars backe 2, 5th floor, office 4516

Papers

  • Susanna F. de Rezende, Or Meir, Jakob Nordström, and Robert Robere. Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Submitted manuscript, 2019.
  • Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, and Marc Vinyals. Lifting with Simple Gadgets and Applications for Cutting Planes. Submitted manuscript, 2018.
  • Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Jakob Nordström, Massimo Lauria, and Alexander Razborov. Clique is Hard on Average for Regular Resolution. In Proceedings of the 50th Annual ACM Symposiumn on Theory of Computing (STOC 2018), June 2018.
  • Joël Alwen, Susanna F. de Rezende, Jakob Nordström, and Marc Vinyals. Cumulative Space in Black-White Pebbling and Resolution. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), January 2017.
  • 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 2016), October 2016.
  • Julio Araujo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, and Phablo F.S. Moura. On the Proper Orientation Number of Bipartite Graphs. In Theoretical Computer Science, 566 59-75, February 2015.
  • Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martins, and Yoshiko Wakabayashi. Intersecting Longest Paths. In Discrete Mathematics, 313 1401-1408, June 2013.
  • Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martins, and Yoshiko Wakabayashi. Intersection of Longest Paths in a Graph. In Electronic Notes in Discrete Mathematics (EuroComb '11) 38 743-748, December 2011.

Other

I am one of the organizers of the workshop Rising Stars at KTH.
Published by: Susanna F. de Rezende <sfdr~at~kth~dot~se>
Updated 2018-08-20