Geometric complexity theory and tensor rank. - Peter Bürgisser; Christian Ikenmeyer (STOC, 2011)

Explicit lower bounds via geometric complexity theory. - Peter Bürgisser; Christian Ikenmeyer (STOC, 2013)

Computer aided methods for lower bounds on the border rank - Jonathan D. Hauenstein; Christian Ikenmeyer; J. M. Landsberg (CoRR, 2013)

Equations for Lower Bounds on Border Rank. - Jonathan D. Hauenstein; Christian Ikenmeyer; J. M. Landsberg (Exp. Math., 2013)

Deciding Positivity of Littlewood-Richardson Coefficients. - Peter Bürgisser; Christian Ikenmeyer (SIAM J. Discret. Math., 2013)

Binary Determinantal Complexity. - Jesko Hüttenhain; Christian Ikenmeyer (CoRR, 2014)

Fundamental invariants of orbit closures. - Peter Bürgisser; Christian Ikenmeyer (CoRR, 2015)

Permanent versus determinant: not via saturations of monoids of representations. - Peter Bürgisser; Christian Ikenmeyer; Jesko Hüttenhain (CoRR, 2015)

The Saxl conjecture and the dominance order. - Christian Ikenmeyer (Discret. Math., 2015)

No Occurrence Obstructions in Geometric Complexity Theory. - Peter Bürgisser; Christian Ikenmeyer; Greta Panova (FOCS, 2016)

Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory. - Christian Ikenmeyer; Greta Panova (FOCS, 2016)

The geometry of rank decompositions of matrix multiplication I: 2x2 matrices. - Luca Chiantini; Christian Ikenmeyer; J. M. Landsberg; Giorgio Ottaviani (CoRR, 2016)

Geometric complexity theory and matrix powering. - Fulvio Gesmundo; Christian Ikenmeyer; Greta Panova (CoRR, 2016)

On the complexity of the permanent in various computational models. - Christian Ikenmeyer; J. M. Landsberg (CoRR, 2016)

Complexity of Linear Circuits and Geometry. - Fulvio Gesmundo; Jonathan D. Hauenstein; Christian Ikenmeyer; J. M. Landsberg (Found. Comput. Math., 2016)

On vanishing of Kronecker coefficients. - Christian Ikenmeyer; Ketan D. Mulmuley; Michael Walter 005 (Comput. Complex., 2017)

Strassen's 2x2 matrix multiplication algorithm: A conceptual perspective. - Christian Ikenmeyer; Vladimir Lysikov (CoRR, 2017)

On algebraic branching programs of small width. - Karl Bringmann; Christian Ikenmeyer; Jeroen Zuiddam (Electron. Colloquium Comput. Complex., 2017)

Symmetrizing tableaux and the 5th case of the Foulkes conjecture. - Man Wai Cheung; Christian Ikenmeyer; Sevak Mkrtchyan (J. Symb. Comput., 2017)

The geometry of rank decompositions of matrix multiplication II: 3×3 matrices. - Grey Ballard; Christian Ikenmeyer; J. M. Landsberg; Nick Ryder (CoRR, 2018)

Generalized Matrix Completion and Algebraic Natural Proofs. - Markus Bläser; Christian Ikenmeyer; Gorav Jindal; Vladimir Lysikov (Electron. Colloquium Comput. Complex., 2018)

On the relative power of reduction notions in arithmetic circuit complexity. - Christian Ikenmeyer; Stefan Mengel (Inf. Process. Lett., 2018)

Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory. - Markus Bläser; Christian Ikenmeyer; Vladimir Lysikov; Anurag Pandey 001; Frank-Olaf Schreyer (CoRR, 2019)

Hyperpfaffians and Geometric Complexity Theory. - Christian Ikenmeyer; Michael Walter 005 (CoRR, 2019)

The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices. - Luca Chiantini; Christian Ikenmeyer; J. M. Landsberg; Giorgio Ottaviani (Exp. Math., 2019)

On the Complexity of Hazard-free Circuits. - Christian Ikenmeyer; Balagopal Komarath; Christoph Lenzen 001; Vladimir Lysikov; Andrey Mokhov; Karteek Sreenivasaiah (J. ACM, 2019)

Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. - Ankit Garg; Christian Ikenmeyer; Visu Makam; Rafael Mendes de Oliveira; Michael Walter 005; Avi Wigderson (CCC, 2020)

Implementing geometric complexity theory: on the separation of orbit closures via symmetries. - Christian Ikenmeyer; Umangathan Kandasamy (STOC, 2020)

The Computational Complexity of Plethysm Coefficients. - Nick Fischer; Christian Ikenmeyer (Comput. Complex., 2020)

Algebraic Branching Programs, Border Complexity, and Tangent Spaces. - Markus Bläser; Christian Ikenmeyer; Meena Mahajan; Anurag Pandey 001; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2020)

On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. - Julian Dörfler; Christian Ikenmeyer; Greta Panova (SIAM J. Appl. Algebra Geom., 2020)

On the Complexity of Evaluating Highest Weight Vectors. - Markus Bläser; Julian Dörfler; Christian Ikenmeyer (CCC, 2021)

On the Orbit Closure Containment Problem and Slice Rank of Tensors. - Markus Bläser; Christian Ikenmeyer; Vladimir Lysikov; Anurag Pandey 001; Frank-Olaf Schreyer (SODA, 2021)

Young Flattenings in the Schur module basis. - Lennart J. Haas; Christian Ikenmeyer (CoRR, 2021)

Karchmer-Wigderson Games for Hazard-free Computation. - Christian Ikenmeyer; Balagopal Komarath; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2021)

What is in #P and what is not? - Christian Ikenmeyer; Igor Pak (FOCS, 2022)

Degree-Restricted Strength Decompositions and Algebraic Branching Programs. - Fulvio Gesmundo; Purnata Ghosal; Christian Ikenmeyer; Vladimir Lysikov (FSTTCS, 2022)

Border complexity via elementary symmetric polynomials. - Pranjal Dutta; Fulvio Gesmundo; Christian Ikenmeyer; Gorav Jindal; Vladimir Lysikov (Electron. Colloquium Comput. Complex., 2022)

A note on VNP-completeness and border complexity. - Christian Ikenmeyer; Abhiroop Sanyal (Inf. Process. Lett., 2022)

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. - Christian Ikenmeyer; Igor Pak; Greta Panova (SODA, 2023)

All Kronecker coefficients are reduced Kronecker coefficients. - Christian Ikenmeyer; Greta Panova (CoRR, 2023)

Advanced Spikes 'n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable. - Christian Ikenmeyer; Dylan Khangure (FUN, 2024)

Functional Closure Properties of Finite ℕ-Weighted Automata. - Julian Dörfler; Christian Ikenmeyer (ICALP, 2024)

Homogeneous Algebraic Complexity Theory and Algebraic Formulas. - Pranjal Dutta; Fulvio Gesmundo; Christian Ikenmeyer; Gorav Jindal; Vladimir Lysikov (ITCS, 2024)

Fixed-Parameter Debordering of Waring Rank. - Pranjal Dutta; Fulvio Gesmundo; Christian Ikenmeyer; Gorav Jindal; Vladimir Lysikov (STACS, 2024)

On the Power of Border Width-2 ABPs over Fields of Characteristic 2. - Pranjal Dutta; Christian Ikenmeyer; Balagopal Komarath; Harshil Mittal; Saraswati Girish Nanoti; Dhara Thakkar (STACS, 2024)

Algebraic Metacomplexity and Representation Theory. - Maxim van den Berg; Pranjal Dutta; Fulvio Gesmundo; Christian Ikenmeyer; Vladimir Lysikov (CCC, 2025)

Which Graph Motif Parameters Count? - Markus Bläser; Radu Curticapean; Julian Dörfler; Christian Ikenmeyer (MFCS, 2025)

Strassen's algorithm via orbit flip graphs. - Christian Ikenmeyer; Jakob Moosbauer (CoRR, 2025)

Geometric complexity theory for product-plus-power. - Pranjal Dutta; Fulvio Gesmundo; Christian Ikenmeyer; Gorav Jindal; Vladimir Lysikov (J. Symb. Comput., 2026)