Maxime Larcher

ETH Zürich
Maxime Larcher
Institut für Theoretische Informatik
OAT S 28
Andreasstrasse 5
8050 Zürich

E-Mail: larcherm@inf.ethz.ch

Academic Background and Research Interests

Between 2014 and 2017, I studied Computer Science at École polytechnique (Palaiseau, France) where I received a Titre d'Ingénieur diplômé de l'École polytechnique as well as a Diplôme de l'École polytechnique. In 2017, I chose to join ETH Zürich where I studied Theoritical Computer Science and obtained Master of Science ETH en Informatique in 2019.

Shortly after obtaining my Master of Science from ETH, I joined the group of Prof. Dr. Angelika Steger whene I am currently doing a PhD.

My research interests include Combinatorics, Probabilistic Combinatorics, Graph and Extremal Graph Theory, as well as Combinatorial Games, which I conducted my Master Thesis on.

Publications

Published

OneMax is not the Easiest Function for Fitness Improvements
(EVOCop'23 — Joint with M. Kaufmann, J. Lengler and X. Zou)

A Simple Optimal Algorithm for the 2-Arm Bandit Problem
(SOSA'23 — Joint with R. Meier and A. Steger)

Self-adjusting Population Sizes for the (1, λ)-EA on Monotone Functions
(PPSN'22 — Joint with M. Kaufmann, J. Lengler and X. Zou)

Solving Static Permutation Mastermind using O(nlogn) Queries
(EJC'22 — Joint with A. Martinsson and A. Steger)

Note on Long Paths in Eulerian Digraphs
(EJC'21 — Joint with C. Knierim and A. Martinsson)

Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs
(JCTB'20 — Joint with C. Knierim, A. Martinsson and A. Noever)

Preprints

Maker-Breaker Games on Random Hypergraphs