Algorithms and Complexity Theory Seminars

The seminars are open to the public, everybody is welcome! Unless stated otherwise, the seminars are on Thursdays at 2pm and the group goes for lunch before the seminar. If you would like to be reminded of forthcoming seminars, please subscribe to the algorithms-seminar mailing list by sending an email with subject line 'subscribe' (without quotes) to cs-algorithms-seminars-subscribe@maillist.ox.ac.uk. If you have trouble subscribing, contact Sandra.

Upcoming seminarsPrevious seminars

 Subscribe to this seminar series calendar.

• 12Nov
  Feasibly Constructive Proofs of Schwartz-Zippel Lemma

  14:00 Thursday 12th November ( week 5, Michaelmas Term 2026 ) in Room 051

  Albert Atserias ( Technical University of Catalonia )
• 19Nov
  Beyond dichotomies: Constraint Satisfaction over stable ω-categorical structures

  14:00 Thursday 19th November ( week 6, Michaelmas Term 2026 ) in Room 051

  Christoph Spiess ( TU Vienna )
• 26Nov
  Fatness, Flatness, and the Semi-half-graph Algorithm

  14:00 Thursday 26th November ( week 7, Michaelmas Term 2026 ) in Room 051

  Michał Pilipczuk ( TU Darmstadt )
• 3Dec
  TBA

  14:00 Thursday 3rd December ( week 8, Michaelmas Term 2026 ) in Room 051

  Steffen van Bergerem ( Humboldt University Berlin )
• 21Jan
  TBA

  14:00 Thursday 21st January ( week 1, Hilary Term 2027 ) in Room 051

  Júlia Baligacs ( University of Oxford )