Talks   

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:


18-highlights.pdf

Weak Cost Register Automata: Still Too Powerful


Presented at Highlights, Berlin in Sep. 2018
18-dlt.pdf

Weak Cost Register Automata: Still Too Powerful


Presented at DLT, Tokyo in Sep. 2018
18-warwick.pdf

Weak Cost Register Automata: Still Too Powerful


Presented at University of Warwick in Mar. 2018 (Also presented in Oxford)
17-highlights.pdf

A Crevice on the Crane Beach: Finite-Degree Predicates


Presented at Highlights, London in Sep. 2017
17-csl.pdf

Very weak counting in FO


Presented at CSL, Stockholm in Jul. 2017
17-icalp.pdf

Continuity & Rational Functions


Presented at ICALP, Warsaw in Jul. 2017
17-lics.pdf

A Crevice on the Crane Beach: Finite-Degree Predicates


Presented at LICS, Reykjavik in Jun. 2017
17-irif.pdf

Continuity & Transductions


Presented at IRIF, Paris in Apr. 2017 (Also presented at the Turing institute video)
17-dagstuhl.pdf

Continuity & Rational Functions


Presented at Dagstuhl Seminar 17142 in Mar. 2017
16-oxford-iw.pdf

Formal Language Theory & Skolem-Type Problems


Presented at University of Oxford in Dec. 2016
16-highlights.pdf

Continuity: A Study of Transducer Composability


Presented at Highlights, Brussels in Sep. 2016 (Best talk award)
16-dlt.pdf

A Language-Theoretical Approach to Descriptive Complexity


Presented at DLT, Montrťal in Sep. 2016
16-bruxelles.pdf

Parikh Automata: Theme & Variations on Tame Register Testing


Presented at Universitť Libre de Bruxelles, Brussels in Feb. 2016 (Also presented in Tuebingen and Oxford)
15-chennai.pdf

Recognizing Languages: Unifying circuits, logic, and algebra


Presented at IMSC, Chennai in Nov. 2015
15-dagstuhl.pdf

Transductions: from Circuits to Continuity


Presented at Dagstuhl Seminar 15401 in Oct. 2015
15-highlights.pdf

The Circuit Complexity of Transductions


Presented at Highlights, Prague in Sep. 2015
15-mfcs.pdf

The Circuit Complexity of Transductions


Presented at MFCS, Milan in Aug. 2015
15-ncma.pdf

Value Automata with Filters


Presented at NCMA, Porto in Aug. 2015
15-tueftler.pdf

The Constant-Depth Circuit Complexity of Rational Transductions


Presented at Tueftler, Freudenstadt in Feb. 2015
14-highlights.pdf

Extremely Uniform Branching Programs


Presented at Highlights, Paris in Sep. 2014
14-ncma.pdf

Extremely Uniform Branching Programs


Presented at NCMA, Kassel in Aug. 2014 (Most lively talk award)
13-cai.pdf

The Algebraic Theory of Parikh Automata


Presented at CAI, Porquerolles in Sep. 2013
13-defense.pdf

Automata with Semilinear Constraints


Presented at Thesis defense, Montreal in May. 2013
12-dlt.pdf

Unambiguous Constrained Automata


Presented at DLT, Taipei in Aug. 2012
11-tuebingen.pdf

Parikh Automata and Friends


Presented at Universitšt TŁbingen in Sep. 2011
11-words.pdf

Bounded Parikh Automata


Presented at WORDS, Prague in Sep. 2011
10-predoc.pdf

Autour de l'automate de Parikh


Presented at Universitť de Montreal in Aug. 2010 (PhD project presentation)