BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T052442Z
UID:Seminar-dept-470@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20181211T140000
DTEND:20181211T150000
SUMMARY:School Seminar Series
DESCRIPTION:Nathanaël Fijalkow: Understanding the quasipolynomial time algorithms for parity games: upper and lower bounds\n\nIn this talk I will show a unifying approach for the three recent quasipolynomial time algorithms for parity games. The first outcome is to give simple presentations and proofs of the algorithms. The second and main outcome is to prove lower bounds in this framework.\n\n\n\nThis talk is based on joint works with Wojciech Czerwiński, Laure Daviaud, Marcin Jurdziński, Ranko Lazić, and Paweł Parys to be presented at SODA'2019, as well  as more recent work with Thomas Colcombet.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=470
LOCATION:H223
END:VEVENT
END:VCALENDAR