Susanna F. de Rezende

Cited by

	All	Since 2019
Citations	312	241
h-index	11	10
i10-index	11	10

20122013201420152016201720182019202020212022202320241 2 2 7 7 18 20 23 30 55 43 42 48

Public access

View all

13 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Jakob NordströmUniversity of Copenhagen and Lund UniversityVerified email at di.ku.dk
Robert RobereMcGill UniversityVerified email at cs.mcgill.ca
Or MeirAssociate Professor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Marc VinyalsUniversity of AucklandVerified email at auckland.ac.nz
Dmitry SokolovÉcole Polytechnique Fédérale de LausanneVerified email at epfl.ch
Yoshiko WakabayashiProfessor of Computer Science, University of São PauloVerified email at ime.usp.br
Mika GöösEPFLVerified email at epfl.ch
Massimo LauriaSapienza - Università di RomaVerified email at uniroma1.it
Cristina G. FernandesProfessor of Computer Science, University of Sao Paulo, BrazilVerified email at ime.usp.br
Kilian Rissepostdoc at EPFLVerified email at epfl.ch
Albert AtseriasUniversitat Politècnica de Catalunya, BarcelonaVerified email at cs.upc.edu
Ilario BonacinaUniversitat Politècnica de CatalunyaVerified email at cs.upc.edu
Alexander RazborovUniversity of ChicagoVerified email at math.uchicago.edu
Phablo F. S. MouraKU LeuvenVerified email at kuleuven.be
Júlio César Silva AraujoUniversidade Federal do CearáVerified email at mat.ufc.br
Aaron PotechinUniversity of ChicagoVerified email at uchicago.edu
Cid Carvalho de SouzaInstitute of Computing - University of Campinas, BrazilVerified email at ic.unicamp.br
Allan SapucaiaPostdoctoral Scientist - Amazon LuxembourgVerified email at amazon.lu
Pedro J. de RezendeInstitute of Computing - UNICAMP - Campinas - BrazilVerified email at ic.unicamp.br
Andre Augusto CireAssociate Professor, University of Toronto Scarborough and Rotman School of ManagementVerified email at rotman.utoronto.ca

Susanna F. de Rezende

Lund University

Verified email at cs.lth.se - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	65	2016
Intersecting longest paths SF de Rezende, CG Fernandes, DM Martin, Y Wakabayashi Discrete Mathematics 313 (12), 1401-1408, 2013	33	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	32	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	28	2020
Automating algebraic proof systems is NP-hard SF De Rezende, M Göös, J Nordström, T Pitassi, R Robere, D Sokolov Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021	25*	2021
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
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	18	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	17	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	14*	2021
The Power of Negative Reasoning SF de Rezende, M Lauria, J Nordström, D Sokolov 36th Computational Complexity Conference (CCC 2021), 2021	14	2021
Guest Column: Proofs, Circuits, and Communication SF de Rezende, M Göös, R Robere ACM SIGACT News 53 (1), 59-82, 2022	12	2022
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	8	2011
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	7	2019
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	5	2021
Clique is hard on average for unary Sherali-Adams SF De Rezende, A Potechin, K Risse 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 12-25, 2023	4	2023
Lower Bounds and Trade-offs in Proof Complexity SF de Rezende KTH Royal Institute of Technology, 2019	3	2019
Covering Points with Unit Disks under Color Constraints A Sapucaia, A Cire, P de Rezende, S de Rezende, C de Souza Available at SSRN 4334380, 2023	2	2023
Caminhos mais longos em grafos SF De Rezende Dissertaçao de Mestrado, Instituto de Matemática e Estatıstica, Universidade …, 2014	2	2014
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz J Conneryd, SF De Rezende, J Nordström, S Pang, K Risse 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 1-11, 2023	1	2023
KRW Composition Theorems via Lifting SF Rezende, O Meir, J Nordström, T Pitassi, R Robere computational complexity 33 (1), 1-97, 2024		2024

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors