| Publication | Date of Publication | Type |
|---|
| All Kronecker coefficients are reduced Kronecker coefficients | 2024-11-24 | Paper |
| Positivity of the symmetric group characters is as hard as the polynomial time hierarchy | 2024-10-25 | Paper |
| Karchmer-Wigderson games for hazard-free computation | 2024-09-25 | Paper |
| Degree-restricted strength decompositions and algebraic branching programs | 2024-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147409 | 2024-01-15 | Paper |
| Homogeneous Algebraic Complexity Theory and Algebraic Formulas | 2023-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6115392 | 2023-07-12 | Paper |
| A remark on the quantum complexity of the Kronecker coefficients | 2023-07-05 | Paper |
| All Kronecker coefficients are reduced Kronecker coefficients | 2023-05-04 | Paper |
| De-bordering and Geometric Complexity Theory for Waring rank and related models | 2022-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092471 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091206 | 2022-07-21 | Paper |
| Positivity of the symmetric group characters is as hard as the polynomial time hierarchy | 2022-07-12 | Paper |
| Equations for GL invariant families of polynomials | 2022-05-04 | Paper |
| Degree-restricted strength decompositions and algebraic branching programs | 2022-05-04 | Paper |
| What is in #P and what is not? | 2022-04-27 | Paper |
| A note on VNP-completeness and border complexity | 2022-04-07 | Paper |
| The computational complexity of plethysm coefficients | 2021-05-25 | Paper |
| Young Flattenings in the Schur module basis | 2021-04-06 | Paper |
| Implementing geometric complexity theory: on the separation of orbit closures via symmetries | 2021-01-19 | Paper |
| On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions | 2020-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111150 | 2020-05-26 | Paper |
| On the Complexity of Hazard-free Circuits | 2020-02-11 | Paper |
| Hyperpfaffians and Geometric Complexity Theory | 2019-12-19 | Paper |
| Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective | 2019-12-17 | Paper |
| Implementing geometric complexity theory: On the separation of orbit closures via symmetries | 2019-11-10 | Paper |
| Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory | 2019-11-06 | Paper |
| Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings | 2019-10-02 | Paper |
| Generalized matrix completion and algebraic natural proofs | 2019-08-22 | Paper |
| On the complexity of hazard-free circuits | 2019-08-22 | Paper |
| The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices | 2019-08-13 | Paper |
| The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices | 2019-04-25 | Paper |
| On Algebraic Branching Programs of Small Width | 2019-02-25 | Paper |
| Symmetrizing tableaux and the 5th case of the Foulkes conjecture | 2019-01-21 | Paper |
| No occurrence obstructions in geometric complexity theory | 2018-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584049 | 2018-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3176573 | 2018-07-23 | Paper |
| Polynomials and the exponent of matrix multiplication | 2018-07-04 | Paper |
| On vanishing of Kronecker coefficients | 2017-12-18 | Paper |
| On the relative power of reduction notions in arithmetic circuit complexity | 2017-11-22 | Paper |
| Geometric complexity theory and matrix powering | 2017-11-21 | Paper |
| Rectangular Kronecker coefficients and plethysms in geometric complexity theory | 2017-09-19 | Paper |
| On the complexity of the permanent in various computational models | 2017-08-08 | Paper |
| Fundamental invariants of orbit closures | 2017-03-16 | Paper |
| Permanent versus determinant: Not via saturations | 2016-12-29 | Paper |
| Small Littlewood-Richardson coefficients | 2016-08-12 | Paper |
| Erratum to: ``Small Littlewood-Richardson coefficients | 2016-08-12 | Paper |
| Complexity of linear circuits and geometry | 2016-06-29 | Paper |
| Binary determinantal complexity | 2016-05-20 | Paper |
| 16,051 formulas for Ottaviani's invariant of cubic threefolds | 2015-12-07 | Paper |
| On McKay's propagation theorem for the Foulkes conjecture | 2015-09-16 | Paper |
| The Saxl conjecture and the dominance order | 2015-06-29 | Paper |
| Explicit lower bounds via geometric complexity theory | 2014-08-07 | Paper |
| Geometric complexity theory and tensor rank | 2014-06-05 | Paper |
| Equations for Lower Bounds on Border Rank | 2014-05-13 | Paper |
| Deciding Positivity of Littlewood--Richardson Coefficients | 2014-04-10 | Paper |
| Nonvanishing of Kronecker coefficients for rectangular shapes. | 2011-07-07 | Paper |
| Even partitions in plethysms. | 2011-05-16 | Paper |
| Fixed-parameter debordering of Waring rank | N/A | Paper |
