| Publication | Date of Publication | Type |
|---|
| On the algebraic proof complexity of tensor isomorphism | 2024-11-19 | Paper |
| Matrix multiplication via matrix groups | 2024-09-25 | Paper |
| Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms | 2024-07-03 | Paper |
| Polynomial-time axioms of choice and polynomial-time cardinality | 2023-07-26 | Paper |
| On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors | 2023-07-12 | Paper |
| On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups | 2023-06-05 | Paper |
| On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness | 2023-04-28 | Paper |
| Matrix multiplication via matrix groups | 2022-04-07 | Paper |
| On the parallel complexity of Group Isomorphism via Weisfeiler-Leman | 2021-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5011878 | 2021-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5011873 | 2021-08-30 | Paper |
| Minimum Circuit Size, Graph Isomorphism, and Related Problems | 2021-06-15 | Paper |
| Computational topology and the Unique Games Conjecture | 2020-08-18 | Paper |
| Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions | 2019-06-29 | Paper |
| Incorporating Weisfeiler-Leman into algorithms for group isomorphism | 2019-05-06 | Paper |
| Wildness for tensors | 2019-03-26 | Paper |
| Circuit Complexity, Proof Complexity, and Polynomial Identity Testing | 2019-02-25 | Paper |
| On cap sets and the group-theoretic approach to matrix multiplication | 2019-01-09 | Paper |
| New applications of the polynomial method: The cap set conjecture and beyond | 2018-12-14 | Paper |
| Minimum Circuit Size, Graph Isomorphism, and Related Problems | 2018-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4602399 | 2018-01-10 | Paper |
| Boundaries of VP and VNP | 2017-12-19 | Paper |
| Which groups are amenable to proving exponent two for matrix multiplication? | 2017-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365126 | 2017-09-29 | Paper |
| Designing Strassen's algorithm | 2017-08-30 | Paper |
| Algorithms for Group Isomorphism via Group Extensions and Cohomology | 2017-07-21 | Paper |
| Towards an algebraic natural proofs barrier via polynomial identity testing | 2017-01-06 | Paper |
| Matrix multiplication algorithms from group orbits | 2016-12-05 | Paper |
| NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications | 2016-10-18 | Paper |
| Polynomial-Time Isomorphism Test of Groups that are Tame Extensions | 2016-01-11 | Paper |
| Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition | 2015-10-28 | Paper |
| Unifying known lower bounds via geometric complexity theory | 2015-06-23 | Paper |
| Rotor-Routing and Spanning Trees on Planar Graphs | 2015-06-22 | Paper |
| Report on "Mathematical Aspects of P vs. NP and its Variants." | 2012-03-13 | Paper |
| Lie algebra conjugacy | 2011-12-08 | Paper |
| Complexity classes of equivalence problems revisited | 2011-04-28 | Paper |
| On the Descriptive Complexity of Groups without Abelian Normal Subgroups | N/A | Paper |
| On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications | N/A | Paper |
| On the Constant-Depth Circuit Complexity of Generating Quasigroups | N/A | Paper |
