Department Seminar Series

Unless otherwise stated, the following seminars normally take place in

• the Ashton Lecture Theatre
  (First floor, Ashton Building, location 422 on the campus map)
• on Tuesdays, 1 - 2pm.

If you would like to give a seminar, or to suggest a possible seminar speaker, please contact John Sylvester.

All Seminars

Date	Speaker	Title	Host
25 Mar 2025   13:00	Thomas Erlebach University of Durham		Viktor Zamaraev
18 Feb 2025   13:00	Dillon Mayhew University of Leeds		[johnsyl]
04 Feb 2025   13:00	Andrei Krokhin University of Durham	The complexity of Promise Constraint Satisfaction Problems	Zamaraev
28 Jan 2025   13:00	Leoni Winschermann University of Twente	`Solving' the energy transition - Research on the interface between optimization and application	Prudence Wong
Previous talks
26 Nov 2024   13:00 Ashton Lecture Theatre	Andrew Ryzhikov University of Oxford	How combinatorics stands in the way of matrix reachability (and what we can do about that)	David Purser
19 Nov 2024   13:00 Ashton Lecture Theatre	Luca Zanetti University of Bath	An analysis of Elo rating systems via Markov chains	[johnsyl]
15 Nov 2024   12:00 Ashton Lecture Theatre pizza	Dr. Shufang Zhu	Trustworthy-by-design Autonomous AI Systems
01 Nov 2024   12:00 Ashton Lecture Theatre pizza	Dr. Lutz Oettershagen	Temporal Centrality: Ranking Nodes in Evolving Networks
29 Oct 2024   13:00 Ashton Lecture Theatre	Aris Filos-Ratsikas University of Edinburgh	Pushing the Frontier on Approximate EFX Allocations	Martin Gairing
22 Oct 2024   13:00 Ashton Lecture Theatre	Ron van der Meyden University of New South Wales	Epistemic Model Checking and Synthesis of Byzantine Agreement Protocols	Xiaowei Huang
15 Oct 2024   13:00 Ashton Lecture Theatre	Parinya Chalermsook Aalto University	Fast and Survivable Network Design	Joachim Spoerhase
11 Oct 2024   12:00 Ashton Lecture Theatre pizza	Dr. Gabriella Pizzuto	Closing the Autonomy Gap: Skill Acquisition in Robotic Chemists
17 Sep 2024   13:00 Ashton Lecture Theatre	Andreas Padalkin Paderborn University	Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter	Othon Michail

Older Seminars

ordered by Academic Year

• 2023/24
• 2022/23
• 2021/22
• 2020/21
• 2019/20
• 2018/19
• 2017/18
• 2016/17
• 2015/16
• 2014/15
• 2013/14
• 2012/13
• 2011/12
• 2010/11
• 2009/10
• 2008/09
• 2007/08
• 2006/07
• 2005/06
• 2004/05
• 2003/04
• 2002/03
• 2001/02
• 2000/01

---

Other seminar series

• Algorithms, Complexity Theory and Optimisation
• Argumentation and Representation of Knowledge
• Data Mining and Machine Learning
• Economics and Computation
• Friday Lunch and Talk
• Liverpool Distinguished Computer Science Lecture
• Networks and Distributed Computing
• PhD Tea Talks
• Robotics and Autonomous Systems
• Verification
• Women in Technology
• Overview of all seminar series