Get started
Author

Robert Robere

Observed names: R. Robere, Robere, R, Robere, Robert
Institution: McGill University
ORCID: 0000-0002-6065-6023
Observed ORCID: 0000-0002-6065-6023
OpenAlex ID: A5021914150
Exponential Lower Bounds for Monotone Span Programs
2016 · Robert Robere, Toniann Pitassi, et al. · Annual Symposium on Foundations of Computer Science · 67
Random Θ(log n)-CNFs Are Hard for Cutting Planes
2017 · Noah Fleming, Denis Pankratov, et al. · Annual Symposium on Foundations of Computer Science · 35
Strongly exponential lower bounds for monotone computation
2017 · Toniann Pitassi, Robert Robere · ACM SIGACT Symposium on Theory of Computing (STOC) · 33
Lifting Nullstellensatz to monotone span programs over any field
2018 · Toniann Pitassi, Robert Robere · ACM SIGACT Symposium on Theory of Computing (STOC) · 28
Adventures in Monotone Complexity and TFNP
2019 · Göös, Mika, Kamath, Pritish, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 21
PDF
Interior Point Methods and Linear Programming
2012 · Robert Robere · 17
The Proof Complexity of SMT Solvers
2018 · Robert Robere, Antonina Kolokolova, et al. · Lecture notes in computer science · 16
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
2020 · Susanna de Rezende, Or Meir, et al. · Annual Symposium on Foundations of Computer Science · 14
PDF
On the Power and Limitations of Branch and Cut
2021 · Fleming, Noah, Göös, Mika, et al. · arXiv (Cornell University) · 11
PDF
Average Case Lower Bounds for Monotone Switching Networks
2013 · Yuval Filmus, Toniann Pitassi, et al. · Annual Symposium on Foundations of Computer Science · 10
Separations in Proof Complexity and TFNP
2022 · Mika Goos, Alexandros Hollender, et al. · Annual Symposium on Foundations of Computer Science · 8
Stabbing Planes
2017 · Beame, Paul, Fleming, Noah, et al. · arXiv (Cornell University) · 8
PDF
Separations in Proof Complexity and TFNP
2024 · Mika Göös, Alexandros Hollender, et al. · Journal of the ACM · 6
Guest Column
2022 · S.F. de Rezende, M. Göös, et al. · ACM SIGACT News · 6
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms
2022 · Robert Robere, Jeroen Zuiddam · Annual Symposium on Foundations of Computer Science · 6
Automating algebraic proof systems is NP-hard
2021 · Susanna F. de Rezende, Mika Göös, et al. · ACM SIGACT Symposium on Theory of Computing (STOC) · 6
PDF
KRW Composition Theorems via Lifting
2020 · Susanna F. de Rezende, Or Meir, et al. · Annual Symposium on Foundations of Computer Science · 6
Learning-Sensitive Backdoors with Restarts
2018 · Edward Zulkoski, Ruben Martins, et al. · Lecture notes in computer science · 5
Relating Complexity-theoretic Parameters with SAT Solver Performance
2017 · Zulkoski, Edward, Martins, Ruben, et al. · arXiv (Cornell University) · 5
PDF
Random CNFs are Hard for Cutting Planes
2017 · Fleming, Noah, Pankratov, Denis, et al. · arXiv (Cornell University) · 5
PDF
Complex Analogies: Remarks on the Complexity of HDTP
2012 · Robert Robere, Tarek Richard Besold · Lecture notes in computer science · 5
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
2019 · de Rezende, Susanna F., Nordström, Jakob, et al. · Research at the University of Copenhagen (University of Copenhagen) · 4
When Almost Is Not Even Close: Remarks on the Approximability of HDTP
2013 · Tarek Richard Besold, Robert Robere · Lecture notes in computer science · 4
On Pigeonhole Principles and Ramsey in TFNP
2024 · Siddhartha Jain, Jiawei Li, et al. · Annual Symposium on Foundations of Computer Science · 3
PDF
Black-Box PPP Is Not Turing-Closed
2024 · Noah Fleming, Stefan Grosser, et al. · ACM Symposium on Theory of Computing (STOC) · 3
PDF
Works count: 56
Citation count: 365
H-index: 10
I10-index: 10
Year
Topic
Type