| Separations in Proof Complexity and TFNP M Göös, A Hollender, S Jain, G Maystre, W Pires, R Robere, R Tao Proc. 63rd Foundations of Computer Science (FOCS), 2022, 2022 | 19 | 2022 |
| Further Collapses in TFNP M Göös, A Hollender, S Jain, G Maystre, W Pires, R Robere, R Tao 37th Computational Complexity Conference (CCC 2022), 2022 | 16 | 2022 |
| Randomised Composition and Small-Bias Minimax S Ben-David, E Blais, M Göös, G Maystre Proc. 63rd Foundations of Computer Science (FOCS), 2022, 2022 | 4 | 2022 |
| A Majority Lemma for Randomised Query Complexity M Göös, G Maystre 36th Computational Complexity Conference (CCC 2021), 2021 | 3 | 2021 |
| Communication Efficient Coresets for Maximum Matching M Kapralov, G Maystre, J Tardos Symposium on Simplicity in Algorithms (SOSA), 156-164, 2021 | 3 | 2021 |
| One-Way Functions vs. TFNP: Simpler and Improved L Folwarczný, M Göös, P Hubáček, G Maystre, W Yuan Cryptology ePrint Archive, 2023 | | 2023 |
