Picture of Joshua A. Grochow
Joshua A. Grochow
Assistant Professor
Departments of Computer Science and Mathematics
University of Colorado at Boulder
[first initial][last name]@colorado.edu
I will not be in the office during the coronavirus pandemic. My virtual office is here on Zoom.
Fax: (303) 492-2844 (ATTN: me)
CS Theory @ CU Boulder
Complex Systems @ CU Boulder

Me @ Twitter csthoery.SE mathoverflow ORCID
My pubs @ arXiv ECCC DBLP MathSciNet Google Scholar SciRate

About Me

I am an Assistant Professor in the Departments of Computer Science and Mathematics at the University of Colorado at Boulder, where I am a member of the CS Theory Group and the Complex Systems Group. My research has two main thrusts (with deep underlying relations beneath):

For a taste of the deep underlying relations, check out this brief video.

I was previously an Omidyar Fellow at the interdisciplinary Santa Fe Institute for complex systems. Prior to SFI, I was a postdoc in the University of Toronto CS Theory Group, and prior to that I got my Ph.D. at the University of Chicago.

What's new

(Mar 8 - Jun 11, 2021) IPAM Fellow at the IPAM Long Program on "Tensor Methods and Emerging Applications to the Physical and Data Sciences".

(Feb 23, 2021) I'll give a talk in the Codes and Expansions (CodEx) Seminar.

(Jan 6-8, 2021) Attending (virtually) ITCS '21, where our paper "On the complexity of isomorphism problems for tensors, groups, and polynomials I: Tensor Isomorphism-completeness" will appear. This is part of this preprint, with Youming Qiao.

(Dec 20, 2020) Paper accepted to STACS '21! Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms with Youming Qiao and Gang Tang.

(Dec 2, 2020) New preprint posted, Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms with Youming Qiao and Gang Tang.

(Nov 24, 2020) Gave a talk in the LA Combinatorics & Complexity Seminar, "Designing Strassen's algorithm for matrix multiplication", based on this paper joint with Cris Moore. Watch the video here!

(Nov 17, 2020) Paper accepted to ITCS '21! "On the complexity of isomorphism problems for tensors, groups, and polynomials I: Tensor Isomorphism-completeness." This is part of this preprint, with Youming Qiao.

(Oct 28, 2020) Gave a talk in the Johns Hopkins CS Theory Seminar, "Isomorphism of tensors, algebras, and polynomials, oh my!", based on these three papers.

(Sep 24, 2020) Gave a (virtual) talk at the Clarkson University Center for Complex Systems Science (C3S2), "Understanding large systems from their small parts: Algorithms & theory".

(Sep 10, 2020) Gave a (virtual) talk in our CS Colloquium: "Can we understand big systems from their small parts?", based in part on these three papers.

(Summer 2020) I worked with a great group of students and postdocs this summer! Two high school students (Michael Klyachman, Yerim Song), four undergraduates (Nicole Dong, Ezzeddine El Sai, Sam Serra, Tarek Tohme), 5 graduate students (Gabriel Andrade, Robby Green, Michael Levet, Joel Ornstein, Tzu-Chi Yen), and 3 postdocs Nathan Lindzey, Abhiram Natarajan, Eric Reckwerdt). Crazy but fun - keep an eye out of the results from some of these collaborations!

(Apr 18, 2020) New survey published, in Bull. EATCS, with lots of open questions! Complexity in ideals of polynomials: questions on algebraic complexity of circuits and proofs.

(Spring 2020) Implemented standards-based grading at scale (~300 students) in CSCI 3104 Intro Algorithms, along with Lijun Chen, and a talented team of graduate TAs and undergraduate course assistants.

See all past updates