| How limited interaction hinders real communication (and what it means for proof and circuit complexity) SF de Rezende, J Nordström, M Vinyals 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 58 | 2016 |
| Intersecting longest paths SF de Rezende, CG Fernandes, DM Martin, Y Wakabayashi Discrete Mathematics 313 (12), 1401-1408, 2013 | 28 | 2013 |
| Clique is hard on average for regular resolution A Atserias, I Bonacina, SF De Rezende, M Lauria, J Nordström, ... Journal of the ACM (JACM) 68 (4), 1-26, 2021 | 27 | 2021 |
| Lifting with simple gadgets and applications to circuit and proof complexity S de Rezende, O Meir, J Nordström, T Pitassi, R Robere, M Vinyals 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 24-30, 2020 | 25* | 2020 |
| On the proper orientation number of bipartite graphs J Araujo, N Cohen, SF De Rezende, F Havet, PFS Moura Theoretical Computer Science 566, 59-75, 2015 | 22 | 2015 |
| Automating algebraic proof systems is NP-Hard M Göös, J Nordström, T Pitassi, R Robere, SF de Rezende, D Sokolov Electronic colloquium on computational complexity 27 (64), 2020 | 16* | 2020 |
| Cumulative space in black-white pebbling and resolution J Alwen, SF de Rezende, J Nordström, M Vinyals 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017 | 16* | 2017 |
| Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling SF De Rezende, O Meir, J Nordström, R Robere computational complexity 30 (1), 1-45, 2021 | 13* | 2021 |
| KRW Composition Theorems via Lifting SF de Rezende, O Meir, J Nordström, T Pitassi, R Robere 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 43-49, 2020 | 10 | 2020 |
| The Power of Negative Reasoning SF de Rezende, M Lauria, J Nordström, D Sokolov 36th Computational Complexity Conference (CCC 2021), 2021 | 7* | 2021 |
| Intersection of longest paths in a graph SF de Rezende, CG Fernandes, DM Martin, Y Wakabayashi Electronic Notes in Discrete Mathematics 38, 743-748, 2011 | 6 | 2011 |
| Guest Column: Proofs, Circuits, and Communication SF de Rezende, M Göös, R Robere ACM SIGACT News 53 (1), 59-82, 2022 | 3* | 2022 |
| Automating Tree-Like Resolution in Time n^o(log n) Is ETH-Hard SF de Rezende https://eccc.weizmann.ac.il/report/2021/033/, 2021 | 2 | 2021 |
| Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs SF de Rezende, J Nordström, K Risse, D Sokolov arXiv preprint arXiv:1912.00534, 2019 | 2 | 2019 |
| Lower Bounds and Trade-offs in Proof Complexity SF de Rezende KTH Royal Institute of Technology, 2019 | 1 | 2019 |
| Caminhos mais longos em grafos SF De Rezende Dissertaçao de Mestrado, Instituto de Matemática e Estatıstica, Universidade …, 2014 | 1 | 2014 |
| Intersecçao de caminhos mais longos em um grafo SF de Rezende | | 2010 |
Jakob NordströmUniversity of Copenhagen and Lund UniversityEmail verificata su di.ku.dk
