Rafael Oliveira

Orcid: 0000-0001-8917-8689

Affiliations:
  • University of Waterloo, ON, Canada
  • Princeton University, Department of Computer Science, Princeton, NJ, USA (former)


According to our database1, Rafael Oliveira authored at least 31 papers between 2014 and 2024.

Collaborative distances:

Timeline

2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
1
2
1
1
3
1
1
5
2
1
1
1
2
2
3
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Strong Algebras and Radical Sylvester-Gallai Configurations.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Radical Sylvester-Gallai Theorem for Tuples of Quadratics.
Electron. Colloquium Comput. Complex., 2023

Radical Sylvester-Gallai Theorem for Tuples of Quadratics.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Radical Sylvester-Gallai for Cubics.
Electron. Colloquium Comput. Complex., 2022

Robust Radical Sylvester-Gallai Theorem for Quadratics.
Electron. Colloquium Comput. Complex., 2022

Radical Sylvester-Gallai Theorem for Cubics.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Near optimal sample complexity for matrix and tensor normal models via geodesic convexity.
CoRR, 2021

2020
Operator Scaling: Theory and Applications.
Found. Comput. Math., 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
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits.
Electron. Colloquium Comput. Complex., 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

More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer.
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
Recent progress on scaling algorithms and applications.
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

Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes.
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

Barriers for Rank Methods in Arithmetic Complexity.
Electron. Colloquium Comput. Complex., 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

Much Faster Algorithms for Matrix Scaling.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound.
Electron. Colloquium Comput. Complex., 2016

Algorithmic aspects of Brascamp-Lieb inequalities.
CoRR, 2016

Rank bounds for design matrices with block entries and geometric applications.
CoRR, 2016

Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas.
Comput. Complex., 2016

Factors of low individual degree polynomials.
Comput. Complex., 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

2014
Testing Equivalence of Polynomials under Shifts.
Electron. Colloquium Comput. Complex., 2014

Factors of Sparse Polynomials are Sparse.
Electron. Colloquium Comput. Complex., 2014


  Loading...