Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Talks by Maxime Larcher

2019

June

• June 27, 2019, in CAB G 11, Maxime Larcher: Win Conditions in Maker-Breaker Games on Uniform Hypergraphs [details]

2020

September

• September 15, 2020, in Zoom: conference room, Maxime Larcher: Solving Random Jigsaw Puzzles in Polynomial Time [details]

2021

March

• March 11, 2021, in Zoom: conference room, Maxime Larcher: A More Efficient Algorithm for the Multi-Armed Bandit Problem with Non-Stationary Reward Distribution [details]

October

• October 07, 2021, in CAB G51 and Zoom: conference room, Maxime Larcher: Solving Static Permutation Mastermind using O(n log n) Queries [details]

2022

September

• September 20, 2022, Maxime Larcher: A Random Walk Algorithm for the 2-Armed Bandit [details]

2023

April

• April 06, 2023, Maxime Larcher: Efficient Generation of Size-Conditioned Galton-Watson Trees [details]

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login