Robert Andrews
Email: rgandre2 at illinois dot edu
Office: 3219 Siebel
I will be on the job market for postdoc positions during the 2022–2023 academic year.
I am a final-year PhD student in Computer Science at the University of Illinois Urbana-Champaign.
I am part of the Theory & Algorithms group, where I am fortunate to be advised by Michael A. Forbes.
I primarily work on algebraic complexity theory, but I am broadly interested in computational complexity.
Research
-
On Matrix Multiplication and Polynomial Identity Testing
FOCS 2022
Best Student Paper Award
Invited to SICOMP special issue on FOCS 2022
[arXiv | ECCC | FOCS proceedings]
-
Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals
With Michael A. Forbes.
STOC 2022
Invited to Theory of Computing
[arXiv | ECCC | STOC proceedings]
-
Algebraic Hardness Versus Randomness in Low Characteristic
CCC 2020
[arXiv | ECCC | CCC proceedings]
Teaching
I have been lucky to work as a teaching assistant for the following courses at UIUC.
- Fall 2022
- CS 473: Algorithms
- Fall 2021†
- CS 374: Introduction to Algorithms & Models of Computation
- Fall 2020¶
- CS 473: Algorithms
- Spring 2019†
- CS 374: Introduction to Algorithms & Models of Computation
- Fall 2018†
- CS 374: Introduction to Algorithms & Models of Computation
- Spring 2018
- CS 579: Computational Complexity
- Fall 2017
- CS 475: Formal Models of Computation
†Included on the List of Teachers Ranked as Excellent by Their Students.
¶Received the department’s Outstanding Teaching Assistant award.
Miscellaneous
-
Need more RAM? Just invent time travel!
With Mitchell Jones and Patrick Lin.
SIGBOVIK 2019
"Most Frighteningly like Real Research!" award
[SIGBOVIK proceedings]
