Présentations
As far back as I can remember, I've always thoroughly enjoyed giving talks. My current process involves making the slides with Beamer, then annotating them with LectureNotes, and combining the two using PDFtk.Here are the slides of most of my appearances, in reverse chronological order; the number of slides is enlarged:
Weak Cost Register Automata: Still Too PowerfulPresented at Highlights, Berlin in Sep. 2018 

Weak Cost Register Automata: Still Too PowerfulPresented at DLT, Tokyo in Sep. 2018 

Weak Cost Register Automata: Still Too PowerfulPresented at University of Warwick in Mar. 2018 (Also presented in Oxford) 

A Crevice on the Crane Beach: FiniteDegree PredicatesPresented at Highlights, London in Sep. 2017 

Very weak counting in FOPresented at CSL, Stockholm in Jul. 2017 

Continuity & Rational FunctionsPresented at ICALP, Warsaw in Jul. 2017 

A Crevice on the Crane Beach: FiniteDegree PredicatesPresented at LICS, Reykjavik in Jun. 2017 

Continuity & TransductionsPresented at IRIF, Paris in Apr. 2017 (Also presented at the Turing institute video) 

Continuity & Rational FunctionsPresented at Dagstuhl Seminar 17142 in Mar. 2017 

Formal Language Theory & SkolemType ProblemsPresented at University of Oxford in Dec. 2016 

Continuity: A Study of Transducer ComposabilityPresented at Highlights, Brussels in Sep. 2016 (Best talk award) 

A LanguageTheoretical Approach to Descriptive ComplexityPresented at DLT, Montréal in Sep. 2016 

Parikh Automata: Theme & Variations on Tame Register TestingPresented at Université Libre de Bruxelles, Brussels in Feb. 2016 (Also presented in Tuebingen and Oxford) 

Recognizing Languages: Unifying circuits, logic, and algebraPresented at IMSC, Chennai in Nov. 2015 

Transductions: from Circuits to ContinuityPresented at Dagstuhl Seminar 15401 in Oct. 2015 

The Circuit Complexity of TransductionsPresented at Highlights, Prague in Sep. 2015 

The Circuit Complexity of TransductionsPresented at MFCS, Milan in Aug. 2015 

Value Automata with FiltersPresented at NCMA, Porto in Aug. 2015 

The ConstantDepth Circuit Complexity of Rational TransductionsPresented at Tueftler, Freudenstadt in Feb. 2015 

Extremely Uniform Branching ProgramsPresented at Highlights, Paris in Sep. 2014 

Extremely Uniform Branching ProgramsPresented at NCMA, Kassel in Aug. 2014 (Most lively talk award) 

The Algebraic Theory of Parikh AutomataPresented at CAI, Porquerolles in Sep. 2013 

Automata with Semilinear ConstraintsPresented at Thesis defense, Montreal in May. 2013 

Unambiguous Constrained AutomataPresented at DLT, Taipei in Aug. 2012 

Parikh Automata and FriendsPresented at Universität Tübingen in Sep. 2011 

Bounded Parikh AutomataPresented at WORDS, Prague in Sep. 2011 

Autour de l'automate de ParikhPresented at Université de Montreal in Aug. 2010 (PhD project presentation) 