Rafael Oliveira
Orcid: 0000-0001-8917-8689Affiliations:
- University of Waterloo, ON, Canada
- Princeton University, Department of Computer Science, Princeton, NJ, USA (former)
According to our database1,
Rafael Oliveira
authored at least 34 papers
between 2014 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2025
Rank Bounds and PIT for Σ<sup>3</sup> ΠΣΠ<sup>d</sup> circuits via a non-linear Edelstein-Kelly theorem.
CoRR, April, 2025
Rank Bounds and PIT for $\Sigma^3 \Pi \Sigma \Pi^d$ circuits via a non-linear Edelstein-Kelly theorem.
Electron. Colloquium Comput. Complex., 2025
Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
Proceedings of the 41st International Symposium on Computational Geometry, 2025
2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
2023
Proceedings of the 38th Computational Complexity Conference, 2023
2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Near optimal sample complexity for matrix and tensor normal models via geodesic convexity.
CoRR, 2021
2020
Conditional lower bounds on the spectrahedral representation of explicit hyperbolicity cones.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings.
Proceedings of the 35th Computational Complexity Conference, 2020
2019
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings.
Electron. Colloquium Comput. Complex., 2019
Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes.
CoRR, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Electron. Colloquium Comput. Complex., 2018
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
Polynomial Identity Testing: Derandomization Results and Applications to Algebraic Computation
PhD thesis, 2017
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
CoRR, 2016
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Proceedings of the 30th Conference on Computational Complexity, 2015
Proceedings of the 30th Conference on Computational Complexity, 2015
2014
Electron. Colloquium Comput. Complex., 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014