2022

Ikenmeyer, Christian, Komarath, Balagopal and Saurabh, Nitin (2022) Karchmer-Wigderson games for hazard-free computation. In: 14th Innovations in Theoretical Computer Science (ITCS), MIT in Cambridge, Massachusetts, 11-13 Jan 2023 (In Press)

Ikenmeyer, Christian, Pak, Igor and Panova, Greta (2022) Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. In: ACM-SIAM Symposium on Discrete Algorithms (SODA23), Florence, Italy ; Hybrid, 22-25 Jan 2023 (In Press)

Ikenmeyer, Christian and Pak, Igor (2022) What is in# P and what is not? In: FOCS 2022: 63rd IEEE Symposium on Foundations of Computer Science, Denver, USA, Oct 31 - Nov 3, 2022 (In Press)