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.

	Weak Cost Register Automata: Still Too Powerful Presented at Highlights, Berlin in Sep. 2018
	Weak Cost Register Automata: Still Too Powerful Presented at DLT, Tokyo in Sep. 2018
	Weak Cost Register Automata: Still Too Powerful Presented at University of Warwick in Mar. 2018 (Also presented in Oxford)
	A Crevice on the Crane Beach: Finite-Degree Predicates Presented at Highlights, London in Sep. 2017
	Very weak counting in FO Presented at CSL, Stockholm in Jul. 2017
	Continuity & Rational Functions Presented at ICALP, Warsaw in Jul. 2017
	A Crevice on the Crane Beach: Finite-Degree Predicates Presented at LICS, Reykjavik in Jun. 2017
	Continuity & Transductions Presented at IRIF, Paris in Apr. 2017 (Also presented at the Turing institute video)
	Continuity & Rational Functions Presented at Dagstuhl Seminar 17142 in Mar. 2017
	Formal Language Theory & Skolem-Type Problems Presented at University of Oxford in Dec. 2016
	Continuity: A Study of Transducer Composability Presented at Highlights, Brussels in Sep. 2016 (Best talk award)
	A Language-Theoretical Approach to Descriptive Complexity Presented at DLT, Montréal in Sep. 2016
	Parikh Automata: Theme & Variations on Tame Register Testing Presented at Université Libre de Bruxelles, Brussels in Feb. 2016 (Also presented in Tuebingen and Oxford)
	Recognizing Languages: Unifying circuits, logic, and algebra Presented at IMSC, Chennai in Nov. 2015
	Transductions: from Circuits to Continuity Presented at Dagstuhl Seminar 15401 in Oct. 2015
	The Circuit Complexity of Transductions Presented at Highlights, Prague in Sep. 2015
	The Circuit Complexity of Transductions Presented at MFCS, Milan in Aug. 2015
	Value Automata with Filters Presented at NCMA, Porto in Aug. 2015
	The Constant-Depth Circuit Complexity of Transducers Presented at Tueftler, Freudenstadt in Feb. 2015
	Extremely Uniform Branching Programs Presented at Highlights, Paris in Sep. 2014
	Extremely Uniform Branching Programs Presented at NCMA, Kassel in Aug. 2014 (Most lively talk award)
	The Algebraic Theory of Parikh Automata Presented at CAI, Porquerolles in Sep. 2013
	Automata with Semilinear Constraints Presented at Thesis defense, Montreal in May. 2013
	Unambiguous Constrained Automata Presented at DLT, Taipei in Aug. 2012
	Parikh Automata and Friends Presented at Universität Tübingen in Sep. 2011
	Bounded Parikh Automata Presented at WORDS, Prague in Sep. 2011
	Autour de l'automate de Parikh Presented at Université de Montreal in Aug. 2010 (PhD project presentation)