BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260528T031211Z
UID:Seminar-dept-1036@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20230309T150000
DTEND:20230309T160000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Sagnik Mukhopadhyay: Alice and Bob Walked into a Graph...\n\nI will talk about simple algorithms for cut and flow problems in the 2-party communication setting that can be adapted to many other distributed models of computation quickly. In the realm of data explosion, it is usually the case that a single computational processor is unable to store the vast amount of data needed to do any meaningful computation. We are indeed in the era of distributed computing, but it is not ideal to have different ad-hoc 'model-dependent' algorithms for solving the same problem. I will show recent progress in designing cross-paradigm algorithms that tackle this issue.\n\n\n\nI will show two examples: the minimum-cut problem (or min-cut) and the maximum bipartite matching problem (or BMM) where, in each case, a simple schematic algorithm can be implemented in a number of computational models to achieve the optimal complexity. This is a culmination of a number of papers that appeared in the last couple of years with coauthors Joakim Blikstad, Jan van den Brand, Yuval Efron, Troy Lee, Simon Apers, Pawel Gawrychowski, Michal Dory, Andrés López-Martínez and Danupon Nanongkai.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1036
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR