Logic and algorithms reading group

We have a small reading group dedicated to topics in logic, algorithms and computational complexity. This term (Michaelmas 2012) we meet at 4pm on Tuesdays in FC22 in the Computer Laboratory. If you have stumbled upon this page for some reason and would like to join our meetings, please drop me (bjarki.holm followed by cl.cam.ac.uk) a line. Our schedule is currently as follows:

Date	Speaker	Topic
2012-10-30	Arno Pauly	TBA
2012-11-06	Anuj Dawar	Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers
2012-11-13	Bjarki Holm	TBA

Recent talks in the archive:

Date	Speaker	Topic
2012-10-16	Jannis Bulian	Completeness thresholds for bounded model checking
2012-10-09	Matthew Anderson	Advancing Algebraic and Logical Approaches to Circuit Lower Bounds in Computer Sciences
2011-11-07	Bjarki Holm	A logspace algorithm for canonisation of planar graphs
2011-10-17	Arno Pauly	A synthetic theory of representations
2011-07-14	Eryk Kopczynski	Some random stuff
2011-07-07	Bjarki Holm	Logical reductions between some algebraic membership problems
2011-06-23	Anuj Dawar	A measured collapse of the modal mu-calculus alternation hierarchy
2011-06-16	Adam Bouland	Parameterised complexity of graph isomorphism
2011-06-09	Arno Pauly	Relative computability of (multi-valued) functions
2011-06-02	Eryk Kopczynski	Bounded degree and planar spectra (Part II)
2011-05-26	Bjarki Holm	Graph isomorphism, Sherali-Adams relaxations and expressibility in counting logics
2011-05-19	Angelos Tsolakis	Zero-one laws
2011-05-12	Anuj Dawar	L-recursion and a new logic for logarithmic space
2011-05-05	Eryk Kopczynski	Bounded degree and planar spectra (Part I)
2011-04-27	Arno Pauly	Descriptive complexity over the real numbers
2011-04-20	Wied Pakusa	The structure and complexity of maximum matchings (Part II)
2011-04-13	Wied Pakusa	The structure and complexity of maximum matchings (Part I)
2011-04-06	Adam Bouland	Graph isomorphism on graphs of small crossing number
2011-03-23	Bjarki Holm	Canonical forms for graphs of small colour class size (Part II)
2011-03-23	Bjarki Holm	Canonical forms for graphs of small colour class size (Part I)
2011-03-16	Anuj Dawar	Nowhere dense graph classes, stability, and the independence property
2011-03-09	Eryk Kopczynski	Parikh images of automata
2011-03-02	Angelos Tsolakis	Tree canonisation and transitive closure
2011-02-23	Arno Pauly	Absence of injective representations
2011-02-16	Wied Pakusa	Finite model theory with operators from linear algebra over commutative rings
2011-02-02	Adam Bouland	Parameterised complexity of graph isomorphism
2011-01-26	Bjarki Holm	Descriptive complexity of linear algebra
2010-12-03	Arno Pauly	Models of propositional logics
2010-11-26	Adam Bouland	Parameterised complexity theory
2010-11-19	Anuj Dawar	Decision problems in classes of sparse graphs
2010-11-12	Bjarki Holm	Non-uniform ACC circuit lower bounds
2010-11-05	Arno Pauly	Many-to-one reductions
2010-10-29	Bjarki Holm	Logical complexity of graphs