| No. |
Title |
Author |
Year |
| 1 |
Karchmer-Wigderson Games for Hazard-Free Computation |
Ikenmeyer, Christian et al. |
2023 |
| 2 |
Degree-Restricted Strength Decompositions and Algebraic Branching Programs |
Gesmundo, Fulvio et al. |
2022 |
| 3 |
On the Complexity of Evaluating Highest Weight Vectors |
Bläser, Markus et al. |
2021 |
| 4 |
Algebraic Branching Programs, Border Complexity, and Tangent Spaces |
Bläser, Markus et al. |
2020 |
| 5 |
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings |
Garg, Ankit et al. |
2020 |
| 6 |
On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions |
Dörfler, Julian et al. |
2019 |
| 7 |
On Algebraic Branching Programs of Small Width |
Bringmann, Karl et al. |
2017 |
