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
ECES 118E   (303) 735-7438
CS Theory @ 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. My research has two main thrusts (with deep underlying relations beneath):

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

(Nov 14, 2017) Giving Math Colloquium at CU Boulder: "Wildness & geometry in representation theory & computational complexity." Come check it out in MATH 350!

(Oct 23, 2017) New paper posted: Minimum circuit size, graph isomorphism, and related problems! Joint with Eric Allender, Dieter van Melkebeek, Cris Moore, and Andrew Morgan.

(Oct 6, 2017) Gave a talk at the Rocky Mountain Algebraic Combinatorics Seminar in Fort Collins: Representation theory and additive combinatorics in algorithms for matrix multiplication.

(Sep 1, 2017) New paper posted: Designing Strassen's algorithm, showing a clean proof of Strassen's algorithm using only a simple unitary 2-design in two dimensions. Joint with Cris Moore.

(Jul 7, 2017) The final, open access version of Algorithms for group isomorphism via group extensions and cohomology has now appeared in SIAM Journal on Computation! Joint with Youming Qiao. Open access forever thanks to funding from the Santa Fe Institute.

(Jun 30, 2017) I am now officially, by courtesy, also an Assistant Professor in the Department of Mathematics!

(Jun 23, 2017) Comparing information-theoretic measures of complexity in Boltzmann machines accepted to Entropy! Joint with my former REU student from SFI (now at Berkeley), Max Kanwal, and Nihat Ay.

(May 11, 2017) New paper posted: On the records, joint with the Santa Fe Institute postdocs. This paper was the result of our second (annual?) "72 Hours of Science" event, in which we conceived, developed, executed, and wrote up an entire scientific project in only 72 hours (albeit with a team of 15 postdocs)! See the Appendix of the paper for a little more detail. Comments and suggestions are more than welcome.

(Apr 18, 2017) On cap sets and the group-theoretic approach to matrix multiplication invited as a plenary talk at the STOC TheoryFest, which highlights some of the best CS theory work from any venue in the past two years!

(Apr 3, 2017) Algorithms for group isomorphism via group extensions and cohomology accepted to SIAM Journal on Computing! See the improved results and exposition due to the refereeing process in the updated arXiv version. Joint with Youming Qiao. To appear any day now...

(Jan 16, 2017) On cap sets and the group-theoretic approach to matrix multiplication accepted to Discrete Analysis. Joint with Jonah Blasiak, Thomas Church, Henry Cohn, Eric Naslund, Will Sawin, and Chris Umans.

(Jan 8, 2017) New paper posted: Towards an algebraic natural proofs barrier via polynomial identity testing, joint with Mrinal Kumar, Mike Saks, and Shubhangi Saraf.

(Dec 31, 2016) Excited to be part of the NetSci 2017 program committee!

(Dec 15, 2016) Excited to be part of the FOCS 2017 program committee!

(Dec 6, 2016) New preprint posted: Matrix multiplication algorithms from group orbits, joint with Cris Moore.

(Dec 3, 2016) New paper posted: A quantitative definition of organismality and its application to lichen, led by Eric Libby, joint with Simon DeDeo and David Wolpert.

See all past updates