Talks

ICALP 2021

August 16th, 2021

Invited Talk at the
Parameterized Complexity Seminar
(Homepage / Youtube)

May 18th, 2021

Note: During the talk I claimed that the best known bound of the Matrix Multiplication Exponent is due to Le Gall. However, at the time of the talk, an improved bound had already been established by Alman and Vassilevska Williams.

FOCS 2020

November 19th, 2020

AlgoCompSeminar.pdf

Algorithms and Complexity Seminar

Oxford, February 6th, 2020

ICALP 19 Slides.pdf

ICALP 19

Patras, July 11th, 2019

IPEC 2018 Slides .pdf

IPEC 2018

Helsinki, August 24th, 2018

ESA 2017 Slides.pdf

ESA 2017

Vienna, September 5th, 2017

CSR 2017 Slides.pdf

CSR 2017

Kazan, June 10th, 2017

STACS 2017 Slides.pdf

STACS 2017

Hannover, March 11th, 2017