Maxime Larcher

According to our database, Maxime Larcher authored at least 10 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Hardest Monotone Functions for Evolutionary Algorithms.

Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling

SN Comput. Sci., June, 2025

OneMax Is Not the Easiest Function for Fitness Improvements.

Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou

Evol. Comput., 2025

2023

Self-adjusting population sizes for the (1,<i>λ</i>)-EA on monotone functions.

Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou

Theor. Comput. Sci., November, 2023

Randomness as an Obstacle and a Tool for Optimisation.

Maxime Larcher

PhD thesis, 2023

Gated recurrent neural networks discover attention.

Nicolas Zucchet, Seijin Kobayashi, Yassir Akram, Johannes von Oswald, Maxime Larcher, Angelika Steger, João Sacramento

CoRR, 2023

A Simple Optimal Algorithm for the 2-Arm Bandit Problem.

Maxime Larcher, Robert Meier, Angelika Steger

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

Solving Static Permutation Mastermind using $O(n \log n)$ Queries.

Maxime Larcher, Anders Martinsson, Angelika Steger

Electron. J. Comb., 2022

Self-adjusting Population Sizes for the (1, λ )-EA on Monotone Functions.

Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

2021

Long cycles, heavy cycles and cycle decompositions in digraphs.

Charlotte Knierim, Maxime Larcher, Anders Martinsson, Andreas Noever

J. Comb. Theory B, 2021

Note on Long Paths in Eulerian Digraphs.

Charlotte Knierim, Maxime Larcher, Anders Martinsson

Electron. J. Comb., 2021