### Slides from some talks I've given.

*Limits of Symmetric Computation:*, Archimedeans, Cambridge, 22 November, 2019.-
*Descriptive Complexity*: Lecture 1; Lecture 2; at Caleidoscope Summer School, Paris, June 2019. -
*Definability and Complexity of Counting Logics*: Lecture 1; Lecture 2; Lecture 3. Tutorial at ILLC, Amsterdam, June 2016. *Elementary Equivalence in Finite Structures:*, YuriFest, Berlin, 11 September, 2015.*Symmetric Circuits and Fixed-Point Logics,*Indo-UK Workshop on Computational Complexity, Chennai, 8 January 2015.

There is also a video.*The Power of Fixed-Point Logic with Counting:*, Asian Logic Conference, Mumbai, 5 January, 2015. slides and an abstract.*Tractable Approximations of Graph Isomorphism*, Algebra, Logic and Algorithms Seminar, Leeds, 12 November 2014.*Finite Model Theory and Graph Isomorphism: Lecture 1; Lecture 2; Lecture 3 and Lecture 4,*Algorithms Winter School, Beroun, 12-15 December 2013.*Games and Isomorphism in Finite Model Theory: Part 1 and Part 2 ,*GAMES Winter School, Champery, 6 February 2013.*The Complexity of Satisfaction on Sparse Graphs,*IPEC, Chennai, 15 December 2010.*Pebble Games for Logics with Counting and Rank,*GaLoP, ETAPS, York, 28 March 2009.*On Datalog, LFP and MSO,*LIAFA, Paris, 20 March 2009.*Descriptive Complexity and Polynomial Time: A Tutorial,*WoLLIC, Edinburgh, 2 July 2008.*Constraint Satisfaction Problems and Descriptive Complexity,*AIM Workshop on Universal Algebra, Logic and CSP, Palo Alto, 1 April 2008.*On the Descriptive Complexity of Linear Algebra,*Aachen, 17 December 2007.*Model-Checking First-Order Logic: Automata and Locality,*CSL/Games 2007, Lausanne, 11 September 2007.*Preservation Theorems in Finite Model Theory,*6th Panhellenic Logic Symposium, Volos, 7 July 2007.*Complexity and the Expressive Power of Logics, CUSPOMMS,*Cambridge, 9 March 2007.*Descriptive and Computational Complexity*University of Leicester, 16 February 2007.*Preservation Properties and Databases,*Imperial College, 24 November 2003.*Quantum Automata, Machines and Complexity,*University of Warwick, 24 October 2003.*Fixed-Point Logics and Computation,*ICLMPS'03, Oviedo, 12 August 2003.*Expressiveness and Complexity of a Graph Logic,*LaBRI, Bordeaux, 24 March 2003.*Automaticité des Propriétés Modales des Structures Finies,, CMF 2002,*Arcachon, 23 May 2002.*Complexity as Expressive Power ,*BCTCS, Bristol, 9 April 2002.*Modal Logic and Inflationary Fixed Points,*University of Leicester, 19 October 2001.*Fixed Point Logics on Finite and Infinite Structures,*RWTH, Aachen, 29 November 2000.*Lindström Quantifiers and 0-1 Laws,*Oxford Mathematical Logic Seminar, 24 November, 2000.*Fixed-point Logics and Infinite Trees,*at the ESSLLI2000 workshop on*Trees in Logic, Computer Science and Linguistics*, 17 August 2000.*Formulas, Games and Circuits,*University of Athens, 16 June 2000.*Descriptive Polynomial Complexity,*Computer Laboratory Wednesday seminar, 17 February 1999.

Last modified: Thu Jun 23 14:43:52 BST 2016