I am an Assistant Professor at the Department of Computer Science, LTH, Lund University. My research is in complexity theory, in particular in the areas of proof, circuit and communication complexity. You can read more about me here and about the research team here.
Contact info
-
Email:
susanna.rezende
cs.lth.se
Address: Institutionen för datavetenskap, Lunds universitet
Klas Anselms väg 10, office 2125e, 223 63 Lund, Sweden
News
- January, 2025: We're currently looking for PhD students and a postdoc in theoretical computer science. Oficial announcement and deadline for application coming soon. For more information see open positions and feel free to drop me an email.
- January, 2025: Pre-registration is open for the Caleidoscope ("Complexity as a kaleidoscope") research school, which will be held in Marseille, France, March 31 - April 4, 2025. Topics and lecturers: Communication complexity (Amir Yehudayoff); Metacomplexity (Antonina Kolokolova); Quantum computation and complexity (Richard Kueng); Complexity beyond worst-case analysis (Heiko Röglin); High dimensional expanders (Tali Kaufman); Higher-order complexity (Akitoshi Kawamura).
- December, 2024: The Department of Computer Science has opened a tenure-track assistant professorship position in the foundations of computer science, with a focus on logic and automated reasoning. Official announcement here and more information can be found here.
- September, 2024: We are happy to welcome our new PhD student, David Engström!
Links
- Research team
- About me
- Short cv: PDF (updated Aug 2024)
- Open Positions
- Publications
- Google scholar, Orcid
- Some survey presentations
- Workshop on proof complexity at FOCS '21 (slides and videos)