We stand with Ukraine  

Robert Andrews

Orcid: 0000-0002-6979-8757

Affiliations:
  • University of Waterloo, Cheriton School of Computer Science, Waterloo, Canada
  • Institute for Advanced Study, Princeton, NJ, USA (former)
  • University of Illinois at Urbana Champaign, Department of Computer Science, Urbana, IL, USA (PhD 2023)


According to our database1, Robert Andrews authored at least 11 papers between 2020 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
An Improved Construction of Variety-Evasive Subspace Families.
[BibTeX]
[DOI]
Robert Andrews
,
Abhibhav Garg
Electron. Colloquium Comput. Complex., 2026

Hilbert's Nullstellensatz is in the Counting Hierarchy.
[BibTeX]
[DOI]
Robert Andrews
,
Abhibhav Garg
,
Éric Schost
Electron. Colloquium Comput. Complex., 2026

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs.
[BibTeX]
[DOI]
Robert Andrews
,
Jules Armand
,
Prateek Dwivedi
,
Magnus Rahbek Dalgaard Hansen
,
Nutan Limaye
,
Srikanth Srinivasan
,
Sébastien Tavenas
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
Algebraic Pseudorandomness in VNC<sup>0</sup>.
[BibTeX]
[DOI]
Robert Andrews
Electron. Colloquium Comput. Complex., 2025

Modular composition & polynomial GCD in the border of small, shallow circuits.
[BibTeX]
[DOI]
Robert Andrews
,
Mrinal Kumar
,
Shanthanu S. Rai
Electron. Colloquium Comput. Complex., 2025

Polynomial-Time PIT from (Almost) Necessary Assumptions.
[BibTeX]
[DOI]
Robert Andrews
,
Deepanshu Kush
,
Roei Tell
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Algebraic Pseudorandomness in VNC⁰.
[BibTeX]
[DOI]
Robert Andrews
Proceedings of the 40th Computational Complexity Conference, 2025

2024
Constant-Depth Arithmetic Circuits for Linear Algebra Problems.
[BibTeX]
[DOI]
Robert Andrews
,
Avi Wigderson
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2022
Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals.
[BibTeX]
[DOI]
Robert Andrews
,
Michael A. Forbes
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

On Matrix Multiplication and Polynomial Identity Testing.
[BibTeX]
[DOI]
Robert Andrews
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2020
Algebraic Hardness Versus Randomness in Low Characteristic.
[BibTeX]
[DOI]
Robert Andrews
Proceedings of the 35th Computational Complexity Conference, 2020


  Loading...