default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafael Oliveira 0002
Person information
- affiliation: University of Waterloo, ON, Canada
- affiliation (former): Princeton University, Department of Computer Science, Princeton, NJ, USA
Other persons with the same name
- Rafael Oliveira
- Rafael Oliveira 0001
![[0000-0002-3586-5026]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-3586-5026")
— CSIRO, Data61, Australia (and 1 more) - Rafael Oliveira 0003 — Federal University of Pará, Belém, Brazil
- Rafael Oliveira 0004 — Federal University of Pernambuco, Brazil
- Rafael Oliveira 0005 — University of Toronto, Department of Electrical and Computer Engineering, Toronto, ON, Canada (and 1 more)
- Rafael Oliveira 0007 (aka: Rafael Franco Soares Oliveira) — Rio Maior Polytechnic, Sports Science School, Portugal (and 2 more)
- Rafael Alves Paes de Oliveira (aka: Rafael A. P. Oliveira, Rafael Oliveira 0008) — Federal Technological University of Paraná, Brazil
- Rafael Oliveira 0009 — Universidade Federal do ABC, São Bernardo do Campo, Brazil
- Rafael Oliveira 0010 (aka: Rafael Cardoso de Oliveira) — Instituto Politécnico de Bragança, Research Centre in Digitalization and Intelligent Robotics (CeDRI), Bragança, Portugal
- Rafael Oliveira 0011 — Georgia Institute of Technology, Atlanta, GA, USA
- Rafael Oliveira 0012 — Universidade de Aveiro, Departamento de Electrónica, Telecomunicaçoes e Informática, Aveiro, Portugal
- Rafael Oliveira 0013 — University of Aveiro, Department of Medical Sciences, Aveiro, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Rafael Oliveira, Akash Kumar Sengupta:
Strong Algebras and Radical Sylvester-Gallai Configurations. STOC 2024: 95-105- 2023
- [c19]Abhibhav Garg, Rafael Oliveira, Shir Peleg, Akash Kumar Sengupta:
Radical Sylvester-Gallai Theorem for Tuples of Quadratics. CCC 2023: 20:1-20:30 - [i29]Rafael Oliveira, Akash Kumar Sengupta:
Strong Algebras and Radical Sylvester-Gallai Configurations. CoRR abs/2310.03993 (2023) - [i28]Abhibhav Garg, Rafael Mendes de Oliveira, Shir Peleg, Akash Sengupta:
Radical Sylvester-Gallai Theorem for Tuples of Quadratics. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c18]Abhibhav Garg, Rafael Oliveira, Akash Sengupta:
Robust Radical Sylvester-Gallai Theorem for Quadratics. SoCG 2022: 42:1-42:13 - [c17]Rafael Oliveira, Akash Kumar Sengupta:
Radical Sylvester-Gallai Theorem for Cubics. FOCS 2022: 212-220 - [i27]Abhibhav Garg, Rafael Oliveira, Akash Sengupta:
Robust Radical Sylvester-Gallai Theorem for Quadratics. CoRR abs/2203.05532 (2022) - [i26]Abhibhav Garg, Rafael Mendes de Oliveira, Akash Sengupta:
Robust Radical Sylvester-Gallai Theorem for Quadratics. Electron. Colloquium Comput. Complex. TR22 (2022) - [i25]Rafael Mendes de Oliveira, Akash Sengupta:
Radical Sylvester-Gallai for Cubics. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i24]Cole Franks, Rafael Mendes de Oliveira, Akshay Ramachandran, Michael Walter:
Near optimal sample complexity for matrix and tensor normal models via geodesic convexity. CoRR abs/2110.07583 (2021) - 2020
- [j5]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
Operator Scaling: Theory and Applications. Found. Comput. Math. 20(2): 223-290 (2020) - [c16]Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. CCC 2020: 12:1-12:17 - [c15]Rafael Oliveira:
Conditional lower bounds on the spectrahedral representation of explicit hyperbolicity cones. ISSAC 2020: 396-401
2010 – 2019
- 2019
- [c14]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer. FOCS 2019: 824-844 - [c13]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes. FOCS 2019: 845-861 - [c12]Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. ICALP 2019: 78:1-78:15 - [i23]Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. CoRR abs/1902.07063 (2019) - [i22]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
More barriers for rank methods, via a "numeric to symbolic" transfer. CoRR abs/1904.04299 (2019) - [i21]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. CoRR abs/1910.01251 (2019) - [i20]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes. CoRR abs/1910.12375 (2019) - [i19]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. Electron. Colloquium Comput. Complex. TR19 (2019) - [i18]Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j4]Ankit Garg, Rafael Mendes de Oliveira:
Recent progress on scaling algorithms and applications. Bull. EATCS 125 (2018) - [j3]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 64(8): 5813-5831 (2018) - [c11]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. FOCS 2018: 883-897 - [c10]Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson:
Barriers for Rank Methods in Arithmetic Complexity. ITCS 2018: 1:1-1:19 - [c9]Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory. ITCS 2018: 24:1-24:20 - [c8]Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. STOC 2018: 172-181 - [i17]Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing. CoRR abs/1804.01076 (2018) - [i16]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Efficient algorithms for tensor scaling, quantum marginals and moment polytopes. CoRR abs/1804.04739 (2018) - [i15]Ankit Garg, Rafael Mendes de Oliveira:
Recent progress on scaling algorithms and applications. CoRR abs/1808.09669 (2018) - [i14]Ankit Garg, Rafael Mendes de Oliveira:
Recent progress on scaling algorithms and applications. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [b1]Rafael Mendes de Oliveira:
Polynomial Identity Testing: Derandomization Results and Applications to Algebraic Computation. Princeton University, USA, 2017 - [c7]Zeyuan Allen-Zhu, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Much Faster Algorithms for Matrix Scaling. FOCS 2017: 890-901 - [c6]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. SODA 2017: 2073-2091 - [c5]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. STOC 2017: 397-409 - [i13]Zeyuan Allen Zhu, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Much Faster Algorithms for Matrix Scaling. CoRR abs/1704.02315 (2017) - [i12]Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson:
Barriers for Rank Methods in Arithmetic Complexity. CoRR abs/1710.09502 (2017) - [i11]Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. CoRR abs/1711.08039 (2017) - [i10]Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson:
Barriers for Rank Methods in Arithmetic Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j2]Rafael Oliveira, Amir Shpilka, Ben lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Comput. Complex. 25(2): 455-505 (2016) - [j1]Rafael Oliveira:
Factors of low individual degree polynomials. Comput. Complex. 25(2): 507-561 (2016) - [c4]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing. FOCS 2016: 109-117 - [i9]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
Algorithmic aspects of Brascamp-Lieb inequalities. CoRR abs/1607.06711 (2016) - [i8]Zeev Dvir, Ankit Garg, Rafael Oliveira, József Solymosi:
Rank bounds for design matrices with block entries and geometric applications. CoRR abs/1610.08923 (2016) - [i7]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c3]Rafael Mendes de Oliveira:
Factors of Low Individual Degree Polynomials. CCC 2015: 198-216 - [c2]Rafael Oliveira, Amir Shpilka, Ben Lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. CCC 2015: 304-322 - [i6]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
A deterministic polynomial time algorithm for non-commutative rational identity testing. CoRR abs/1511.03730 (2015) - 2014
- [c1]Zeev Dvir, Rafael Oliveira, Amir Shpilka:
Testing Equivalence of Polynomials under Shifts. ICALP (1) 2014: 417-428 - [i5]Zeev Dvir, Rafael Oliveira, Amir Shpilka:
Testing Equivalence of Polynomials under Shifts. CoRR abs/1401.3714 (2014) - [i4]Rafael Oliveira, Amir Shpilka, Ben Lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. CoRR abs/1411.7492 (2014) - [i3]Zeev Dvir, Rafael Oliveira:
Factors of Sparse Polynomials are Sparse. Electron. Colloquium Comput. Complex. TR14 (2014) - [i2]Zeev Dvir, Rafael Oliveira, Amir Shpilka:
Testing Equivalence of Polynomials under Shifts. Electron. Colloquium Comput. Complex. TR14 (2014) - [i1]Rafael Oliveira, Amir Shpilka, Ben Lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Electron. Colloquium Comput. Complex. TR14 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
