| Self-adjusting Population Sizes for the -EA on Monotone Functions M Kaufmann, M Larcher, J Lengler, X Zou International Conference on Parallel Problem Solving from Nature, 569-585, 2022 | 15 | 2022 |
| Onemax is not the easiest function for fitness improvements M Kaufmann, M Larcher, J Lengler, X Zou Evolutionary Computation, 1-30, 2024 | 10 | 2024 |
| Long cycles, heavy cycles and cycle decompositions in digraphs C Knierim, M Larcher, A Martinsson, A Noever Journal of Combinatorial Theory, Series B 148, 125-148, 2021 | 8 | 2021 |
| Gated recurrent neural networks discover attention N Zucchet, S Kobayashi, Y Akram, J Von Oswald, M Larcher, A Steger, ... arXiv preprint arXiv:2309.01775, 2023 | 4 | 2023 |
| Solving Static Permutation Mastermind using Queries M Larcher, A Martinsson, A Steger arXiv preprint arXiv:2103.02527, 2021 | 3 | 2021 |
| Hardest Monotone Functions for Evolutionary Algorithms M Kaufmann, M Larcher, J Lengler, O Sieberling European Conference on Evolutionary Computation in Combinatorial …, 2024 | 1 | 2024 |
| Note on long paths in eulerian digraphs C Knierim, M Larcher, A Martinsson arXiv preprint arXiv:2103.05330, 2021 | 1 | 2021 |
| Randomness as an Obstacle and a Tool for Optimisation M Larcher ETH Zurich, 2023 | | 2023 |
| A Simple Optimal Algorithm for the 2-Arm Bandit Problem M Larcher, R Meier, A Steger Symposium on Simplicity in Algorithms (SOSA), 365-372, 2023 | | 2023 |
| Maker-Breaker Games on Random Hypergraphs M Larcher arXiv preprint arXiv:2011.13217, 2020 | | 2020 |
