Susanna F. de Rezende
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
12
Venues
5
Active years
2016–2026
Best venue rank
A*
Where they publish
Papers
12 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity. | Susanna F. de Rezende, David Engstrm, Yassine Ghannane, Duri Andrea Janett, Artur Riazanov |
| 2025 | FOCS | The Proof Analysis Problem. | Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki |
| 2025 | STOC | Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. | Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordstrm, Shuo Pang |
| 2025 | STACS | Some Recent Advancements in Monotone Circuit Complexity (Invited Talk). | Susanna F. de Rezende |
| 2023 | FOCS | Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. | Jonas Conneryd, Susanna F. de Rezende, Jakob Nordstrm, Shuo Pang, Kilian Risse |
| 2023 | FOCS | Clique Is Hard on Average for Unary Sherali-Adams. | Susanna F. de Rezende, Aaron Potechin, Kilian Risse |
| 2021 | LAGOS | Automating Tree-Like Resolution in Time | Susanna F. de Rezende |
| 2021 | STOC | Automating algebraic proof systems is NP-hard. | Susanna F. de Rezende, Mika Gs, Jakob Nordstrm, Toniann Pitassi, Robert Robere, Dmitry Sokolov |
| 2020 | FOCS | KRW Composition Theorems via Lifting. | Susanna F. de Rezende, Or Meir, Jakob Nordstrm, Toniann Pitassi, Robert Robere |
| 2020 | FOCS | Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. | Susanna F. de Rezende, Or Meir, Jakob Nordstrm, Toniann Pitassi, Robert Robere, Marc Vinyals |
| 2018 | STOC | Clique is hard on average for regular resolution. | Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordstrm, Alexander A. Razborov |
| 2016 | FOCS | How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). | Susanna F. de Rezende, Jakob Nordstrm, Marc Vinyals |