School of Mathematics

Search site

Algebra, Logic and Algorithms seminar

Seminars will be on Wednesday at 4pm in MALL 1, Level 8, School of Mathematics unless otherwise indicated. All are very welcome. Tea/coffee in the Staff Common Room beforehand at 3.45pm.

Organised by Olaf Beyersdorff and Vincenzo Mantova.


Forthcoming seminars
Wed 10th May, 2017
4:00 PM

Ian Pratt-Hardmann (University of Manchester)
Wed 17th May, 2017
4:00 PM

Edwin Beggs (Swansea University)
Wed 24th May, 2017
4:00 PM

Andre Hernich (University of Liverpool)
Wed 31st May, 2017
4:00 PM

Yann Peresse (University of Hertfordshire)


Past seminars
Wed 22nd March, 2017
4:00 PM

Iddo Tzameret (Royal Holloway, University of London)
Algebraic Proof Complexity
Wed 15th February, 2017
4:00 PM

Ulrich Berger (Swansea University)
A logic for program extraction with bounded non-determinism
Wed 23rd November, 2016
4:00 PM

Isolde Adler (University of Leeds)
Testing properties of sparse relational structures
Wed 2nd November, 2016
4:00 PM

Stefan Dantchev (Durham)
Tseitin contradictions on weak expanders
Wed 19th October, 2016
4:00 PM

Ulrich Hustadt (University of Liverpool)
Resolution-based Reasoning for Coalition Logic
Wed 5th October, 2016
4:00 PM

Meena Mahajan (The Institute of Mathematical Sciences, Chennai)
Completeness and Intermediate Complexity
Wed 28th September, 2016
4:00 PM

Mark Kambites (University of Manchester)
Random walks on semigroups
Wed 15th June, 2016
4:00 PM

Antongiulio Fornasiero (Parma)
Non-elementary lovely pairs
Tue 17th May, 2016
2:00 PM

Prof. Nicholas Trotignon (Lyon Ecole Normale Superieure)
Recognition, chi-boundedness and chords
Wed 27th April, 2016
4:00 PM

Prof. Heribert Vollmer (University of Hannover)
Descriptive Complexity of Arithmetic Complexity Classes
Wed 20th April, 2016
4:00 PM

Dr. Wolfram Bentz (University of Hull)
The rank of the semigroup of transformations preserving a partition
Wed 9th March, 2016
4:00 PM

Prof. Iain Stewart (Durham University)
Some mathematical aspects of data centre networks
Wed 24th February, 2016
4:00 PM

Giuseppe Primiero (Middlesex)
A Calculus for Distrust and Mistrust
Wed 3rd February, 2016
4:00 PM

Jan Pich (Leeds)
Gentzen and Frege systems for QBF
Wed 2nd December, 2015
4:00 PM

Daniela Kuehn (University of Birmingham)
Decompositions of graphs
Wed 25th November, 2015
4:00 PM

Immanuel Halupczok (University of Leeds)
Uniform analysis and transfer principles
Wed 18th November, 2015
4:00 PM

Martin Otto (Technical University Darmstadt)
Local to Global: Amalgamation and Symmetries in Finite Structures
Wed 11th November, 2015
4:00 PM

M. Jerrum (Queen Mary, University of London)
The complexity of approximate counting: low levels of the hierarchy
Wed 21st October, 2015
4:00 PM

Olaf Beyersdorff (University of Leeds)
Proof Complexity of Quantified Boolean Formulas
Wed 21st October, 2015
4:00 PM

Olaf Beyersdorff (University of Leeds)
Proof Complexity of Quantified Boolean Formulas
Wed 30th September, 2015
4:00 PM

Lovkush Agarwal (University of Leeds)
Continuum many maximal-closed subgroups of Sym(N) via reducts of Henson digraphs.
Wed 17th June, 2015
4:00 PM

Ilario Bonacina (Sapienza University Rome)
Strong Size Lower bounds in Resolution via Games
Wed 20th May, 2015
4:00 PM

Prof. Heribert Vollmer (University of Hanover)
Wed 6th May, 2015
4:00 PM

Prof. Einar Steingrimsson (University of Strathclyde)
The topology and permutation pattern of the Mobius function poset
Wed 22nd April, 2015
4:00 PM

Dr. James Mitchell (University of St. Andrews)
Effective computation with finite semigroups
Wed 18th March, 2015
4:00 PM

Dr. Christoph Wintersteiger (Microsoft Research, Cambridge)
Exact Solutions to Floating-Point Arithmetic Formulas
Wed 18th February, 2015
4:00 PM

Prof. Leonid Libkin (University of Edinburgh)
Homomorphism preservation theorems and incomplete information in databases
Wed 10th December, 2014
4:00 PM

Uwe Egly (Vienna University of Technology)
Quantifier Handling in Different Calculi for Quantified Boolean Formulas
Wed 3rd December, 2014
4:00 PM

Renate Schmidt (University of Manchester)
Forgetting and Uniform interpolation for Description Logics
Wed 12th November, 2014
4:00 PM

Anuj Dawar (University of Cambridge)
Tractable Approximations of Graph Isomorphism
Slides from the seminar.
Wed 29th October, 2014
4:00 PM

Neil Ghani (University of Strathclyde)
An Algebraic Approach to Parametricity
Wed 1st October, 2014
4:00 PM

Marco Benini (Universita' dell'Insubria, Varese)
Programming Modulo Representations
Wed 11th June, 2014
4:00 PM

Karteek Sreenivasaiah (Institute of Mathematical Sciences, Chennai)
Verifying proofs with very little resources
Wed 2nd April, 2014
4:00 PM

Peter J. Cameron (University of St. Andrews)
Wed 26th March, 2014
4:00 PM

Martin Liebeck (Imperial College)
Word maps on finite groups
Wed 19th March, 2014
4:00 PM

Charles Steinhorn (Vassar College)
Total and partial orders in o-minimal structures and an application in mathematical economics
Wed 5th March, 2014
4:00 PM

Frank Wolter (Universty of Liverpool)
Ontology-Based Data Access and Non-Uniform Constraint Satisfaction
Wed 19th February, 2014
4:00 PM

Jonathan Ward (University of Leeds)
Wed 11th December, 2013
4:00 PM

Paul Martin (University of Leeds)
Fun with partition categories
Wed 4th December, 2013
4:00 PM

Stanislav Zivny (University of Oxford)
The complexity of finite-valued CSPs
Wed 20th November, 2013
4:00 PM

Kristina Vušković (University of Leeds)
Parametrized algorithm for weighted independent set problem in bull-free graphs
Wed 13th November, 2013
4:00 PM

Dr. Andy Lewis-Pye (London School of Economics)
Digital morphogenesis via Schelling segregation
Wed 16th October, 2013
4:00 PM

Mikolas Janota (Lisbon)
Solving Quantified Boolean Formulas through Expansion: Theory and Practice
Wed 22nd May, 2013
4:00 PM

Robert Marsh (University of Leeds)
Reflection groups, cluster algebras and signed graphs
Wed 8th May, 2013
4:00 PM

Nicola Gambino (University of Leeds)
Homotopical algebra, constructive logic, and certified algorithms
Wed 10th April, 2013
4:00 PM

Professor Anthony Cohn (University of Leeds)
Building qualitative models of spatio-temporal behaviour
Wed 20th March, 2013
4:00 PM

Dr. Barnaby Martin ((Middlesex University London))
A Random Walk through Infinite-domain CSP
Wed 13th March, 2013
4:00 PM

Martin Dyer (School of Computing, University of Leeds)
The counting constraint satisfaction problem