% csauthors.net - beta - BibTeX bibliography of Susanna F. de Rezende
@article{journals/endm/RezendeFMW11,
title = {Intersection of Longest Paths in a Graph.},
year = {2011},
journal = {Electron. Notes Discret. Math.},
author = {{Susanna F. de Rezende} and {Cristina G. Fernandes} and {Daniel M. Martin} and {Yoshiko Wakabayashi}}
}
@article{journals/dm/RezendeFMW13,
title = {Intersecting longest paths.},
year = {2013},
journal = {Discret. Math.},
author = {{Susanna F. de Rezende} and {Cristina G. Fernandes} and {Daniel M. Martin} and {Yoshiko Wakabayashi}}
}
@article{journals/tcs/AraujoCRHM15,
title = {On the proper orientation number of bipartite graphs.},
year = {2015},
journal = {Theor. Comput. Sci.},
author = {{Júlio Araújo 001} and {Nathann Cohen} and {Susanna F. de Rezende} and {Frédéric Havet} and {Phablo F. S. Moura}}
}
@inproceedings{conf/innovations/AlwenRNV17,
title = {Cumulative Space in Black-White Pebbling and Resolution.},
year = {2017},
booktitle = {ITCS},
author = {{Joël Alwen} and {Susanna F. de Rezende} and {Jakob Nordström} and {Marc Vinyals}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA}
}
@article{journals/eccc/MeirNPRR19,
title = {Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.},
year = {2019},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Or Meir} and {Jakob Nordström} and {Toniann Pitassi} and {Robert Robere} and {Susanna F. de Rezende}}
}
@article{journals/eccc/RezendeNRS19,
title = {Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.},
year = {2019},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Susanna F. de Rezende} and {Jakob Nordström} and {Kilian Risse} and {Dmitry Sokolov 001}}
}
@phdthesis{phd/basesearch/Rezende19,
title = {Lower Bounds and Trade-offs in Proof Complexity.},
year = {2019},
author = {{Susanna F. de Rezende}}
}
@inproceedings{conf/focs/RezendeMNPRV20,
title = {Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.},
year = {2020},
booktitle = {FOCS},
author = {{Susanna F. de Rezende} and {Or Meir} and {Jakob Nordström} and {Toniann Pitassi} and {Robert Robere} and {Marc Vinyals}},
publisher = {IEEE},
booktitle = {61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020}
}
@article{journals/eccc/GoosNPRSR20,
title = {Automating Algebraic Proof Systems is NP-Hard.},
year = {2020},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Mika Göös} and {Jakob Nordström} and {Toniann Pitassi} and {Robert Robere} and {Dmitry Sokolov 001} and {Susanna F. de Rezende}}
}
@article{journals/eccc/RezendeMNPR20,
title = {KRW Composition Theorems via Lifting.},
year = {2020},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Susanna F. de Rezende} and {Or Meir} and {Jakob Nordström} and {Toniann Pitassi} and {Robert Robere}}
}
@inproceedings{conf/coco/RezendeLN021,
title = {The Power of Negative Reasoning.},
year = {2021},
booktitle = {CCC},
author = {{Susanna F. de Rezende} and {Massimo Lauria} and {Jakob Nordström} and {Dmitry Sokolov 001}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference).}
}
@inproceedings{conf/lagos/Rezende21,
title = {Automating Tree-Like Resolution in Time no(log n) Is ETH-Hard.},
year = {2021},
booktitle = {LAGOS},
author = {{Susanna F. de Rezende}},
publisher = {Elsevier},
booktitle = {Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, Online Event / São Paulo, Brazil, May 2021.}
}
@article{journals/cc/RezendeMNR21,
title = {Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.},
year = {2021},
journal = {Comput. Complex.},
author = {{Susanna F. de Rezende} and {Or Meir} and {Jakob Nordström} and {Robert Robere}}
}
@article{journals/eccc/Rezende21,
title = {Automating Tree-Like Resolution in Time no(log n) Is ETH-Hard.},
year = {2021},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Susanna F. de Rezende}}
}
@article{journals/eccc/RezendeNV21,
title = {How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity).},
year = {2021},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Susanna F. de Rezende} and {Jakob Nordström} and {Marc Vinyals}}
}
@article{journals/jacm/AtseriasBRLNR21,
title = {Clique Is Hard on Average for Regular Resolution.},
year = {2021},
journal = {J. ACM},
author = {{Albert Atserias} and {Ilario Bonacina} and {Susanna F. de Rezende} and {Massimo Lauria} and {Jakob Nordström} and {Alexander A. Razborov}}
}
@article{journals/corr/abs-2202-08909,
title = {Proofs, Circuits, and Communication.},
year = {2022},
journal = {CoRR},
author = {{Susanna F. de Rezende} and {Mika Göös} and {Robert Robere}}
}
@article{journals/sigact/RezendeGR22,
title = {Guest Column: Proofs, Circuits, and Communication.},
year = {2022},
journal = {SIGACT News},
author = {{Susanna F. de Rezende} and {Mika Göös} and {Robert Robere}}
}
@inproceedings{conf/focs/ConnerydRNPR23,
title = {Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.},
year = {2023},
booktitle = {FOCS},
author = {{Jonas Conneryd} and {Susanna F. de Rezende} and {Jakob Nordström} and {Shuo Pang} and {Kilian Risse}},
publisher = {IEEE},
booktitle = {64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023}
}
@inproceedings{conf/focs/RezendePR23,
title = {Clique Is Hard on Average for Unary Sherali-Adams.},
year = {2023},
booktitle = {FOCS},
author = {{Susanna F. de Rezende} and {Aaron Potechin} and {Kilian Risse}},
publisher = {IEEE},
booktitle = {64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023}
}