Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. - Joshua A. Grochow; Manolis Kellis (RECOMB, 2007)

Code Equivalence and Group Isomorphism. - László Babai; Paolo Codenotti; Joshua A. Grochow; Youming Qiao (SODA, 2011)

Lie algebra conjugacy. - Joshua A. Grochow (Electron. Colloquium Comput. Complex., 2011)

Complexity classes of equivalence problems revisited. - Lance Fortnow; Joshua A. Grochow (Inf. Comput., 2011)

Matrix Isomorphism of Matrix Lie Algebras. - Joshua A. Grochow (CCC, 2012)

Report on "Mathematical Aspects of P vs. NP and its Variants." - Joshua A. Grochow; Korben Rusek (CoRR, 2012)

Unifying and generalizing known lower bounds via geometric complexity theory - Joshua A. Grochow (CoRR, 2013)

A framework for optimal high-level descriptions in science and engineering - preliminary report. - David H. Wolpert; Joshua A. Grochow; Eric Libby; Simon DeDeo (CoRR, 2014)

Circuit complexity, proof complexity, and polynomial identity testing. - Joshua A. Grochow; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2014)

Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract). - Joshua A. Grochow; Youming Qiao (ISAAC, 2015)

Unifying Known Lower Bounds via Geometric Complexity Theory. - Joshua A. Grochow (Comput. Complex., 2015)

Polynomial-time isomorphism test of groups that are tame extensions. - Joshua A. Grochow; Youming Qiao (CoRR, 2015)

Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition. - Laurent Hébert-Dufresne; Joshua A. Grochow; Antoine Allard (CoRR, 2015)

Graph Isomorphism and Circuit Size. - Eric Allender; Joshua A. Grochow; Cristopher Moore (Electron. Colloquium Comput. Complex., 2015)

Monotone projection lower bounds from extended formulation lower bounds. - Joshua A. Grochow (Electron. Colloquium Comput. Complex., 2015)

Boundaries of VP and VNP. - Joshua A. Grochow; Ketan D. Mulmuley; Youming Qiao (ICALP, 2016)

Dynamics of beneficial epidemics. - Andrew Berdahl; Christa Brelsford; Caterina De Bacco; Marion Dumas; Vanessa Ferdinand; Joshua A. Grochow; Laurent Hébert-Dufresne; Yoav Kallus; Christopher P. Kempes; Artemy Kolchinsky; Daniel B. Larremore; Eric Libby; et al. (CoRR, 2016)

On cap sets and the group-theoretic approach to matrix multiplication. - Jonah Blasiak; Thomas Church; Henry Cohn; Joshua A. Grochow; Chris Umans (CoRR, 2016)

Matrix multiplication algorithms from group orbits. - Joshua A. Grochow; Cristopher Moore (CoRR, 2016)

NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications. - Joshua A. Grochow (Electron. Colloquium Comput. Complex., 2016)

Which groups are amenable to proving exponent two for matrix multiplication? - Jonah Blasiak; Thomas Church; Henry Cohn; Joshua A. Grochow; Chris Umans (CoRR, 2017)

Towards an algebraic natural proofs barrier via polynomial identity testing. - Joshua A. Grochow; Mrinal Kumar 001; Michael E. Saks; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2017)

Designing Strassen's algorithm. - Joshua A. Grochow; Cristopher Moore (Electron. Colloquium Comput. Complex., 2017)

Comparing Information-Theoretic Measures of Complexity in Boltzmann Machines. - Maxinder S. Kanwal; Joshua A. Grochow; Nihat Ay (Entropy, 2017)

Algorithms for Group Isomorphism via Group Extensions and Cohomology. - Joshua A. Grochow; Youming Qiao (SIAM J. Comput., 2017)

Computational Topology and the Unique Games Conjecture. - Joshua A. Grochow; Jamie Tucker-Foltz (SoCG, 2018)

Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System. - Joshua A. Grochow; Toniann Pitassi (J. ACM, 2018)

Minimum Circuit Size, Graph Isomorphism, and Related Problems. - Eric Allender; Joshua A. Grochow; Dieter van Melkebeek; Cristopher Moore; Andrew Morgan (SIAM J. Comput., 2018)

Beyond Number of Bit Erasures: New Complexity Questions Raised by Recently Discovered Thermodynamic Costs of Computation. - Joshua A. Grochow; David H. Wolpert (SIGACT News, 2018)

Incorporating Weisfeiler-Leman into algorithms for group isomorphism. - Peter A. Brooksbank; Joshua A. Grochow; Yinan Li; Youming Qiao; James B. Wilson (CoRR, 2019)

Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions. - Joshua A. Grochow; Youming Qiao (CoRR, 2019)

An Improved Algorithm for Coarse-Graining Cellular Automata. - Yerim Song; Joshua A. Grochow (CoRR, 2020)

Complexity in Ideals of Polynomials: Questions on Algebraic Complexity of Circuits and Proofs. - Joshua A. Grochow (Bull. EATCS, 2020)

On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors. - Joshua A. Grochow; Youming Qiao (CCC, 2021)

Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. - Joshua A. Grochow; Youming Qiao; Gang Tang (STACS, 2021)

Weisfeiler-Leman for Group Isomorphism: Action Compatibility. - Joshua A. Grochow; Michael Levet (CoRR, 2021)

Experience Report: Standards-Based Grading at Scale in Algorithms. - Lijun Chen 001; Joshua A. Grochow; Ryan Layer; Michael Levet (ITiCSE (1), 2022)

On the Descriptive Complexity of Groups without Abelian Normal Subgroups. - Joshua A. Grochow; Michael Levet (CoRR, 2022)

On the Algebraic Proof Complexity of Tensor Isomorphism. - Nicola Galesi; Joshua A. Grochow; Toniann Pitassi; Adrian She (CCC, 2023)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman. - Joshua A. Grochow; Michael Levet (FCT, 2023)

Matrix Multiplication via Matrix Groups. - Jonah Blasiak; Henry Cohn; Joshua A. Grochow; Kevin Pratt; Chris Umans (ITCS, 2023)

Polynomial Identity Testing and the Ideal Proof System: PIT is in NP if and only if IPS can be p-simulated by a Cook-Reckhow proof system. - Joshua A. Grochow (CoRR, 2023)

On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract). - Joshua A. Grochow; Michael Levet (GandALF, 2023)

Is stochastic thermodynamics the key to understanding the energy costs of computation? - David H. Wolpert; Jan Korbel; Christopher Lynn; Farita Tasnim; Joshua A. Grochow; Gülce Kardes; James B. Aimone; Vijay Balasubramanian; Eric De Giuli; David Doty; Nahuel Freitas; Matteo Marsili; et al. (CoRR, 2023)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness. - Joshua A. Grochow; Youming Qiao (SIAM J. Comput., 2023)

Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality. - Joshua A. Grochow (Theory Comput. Syst., 2023)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups. - Zhili Chen; Joshua A. Grochow; Youming Qiao; Gang Tang; Chuanqi Zhang (ITCS, 2024)

Constant Depth Circuit Complexity for Generating Quasigroups. - Nathaniel A. Collins; Joshua A. Grochow; Michael Levet; Armin Weiß (ISSAC, 2024)

On p-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors. - Joshua A. Grochow; Youming Qiao (ACM Trans. Comput. Theory, 2024)

Finite Matrix Multiplication Algorithms from Infinite Groups. - Jonah Blasiak; Henry Cohn; Joshua A. Grochow; Kevin Pratt; Chris Umans (ITCS, 2025)

Reconstructing Sets of Strings from Their k-Way Projections: Algorithms & Complexity - (Extended Abstract). - Elise Tate; Joshua A. Grochow (IWOCA, 2025)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials IV: Linear-Length Reductions and Their Applications. - Joshua A. Grochow; Youming Qiao (STOC, 2025)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials V: Over Commutative Rings. - Joshua A. Grochow; Youming Qiao; Katherine E. Stange; Xiaorui Sun (STOC, 2025)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness. - Joshua A. Grochow; Dan Johnson; Michael Levet (CoRR, 2025)

Multivariate Hensel Lifting Without Assuming as Many Variables as Equations. - Joshua A. Grochow (Am. Math. Mon., 2025)