BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260408T161632Z
UID:Seminar-NESTiD-1141@lxserverA.csc.liv.ac.uk.csc.liv.ac.uk
ORGANIZER:CN=Othon Michail:MAILTO:Othon.Michail@liverpool.ac.uk
DTSTART:20211016T000000
DTEND:20211016T010000
SUMMARY:Durham-Liverpool synergy Series
DESCRIPTION:Armando Castaneda: Synchronous t-Resilient Consensus in Arbitrary Graphs\n\nWe study the number of rounds needed to solve consensus in a synchronous network G where at most t nodes may fail by crashing. This problem has been thoroughly studied when G is a complete graph, but very little is known when G is arbitrary. We define a notion of radius(G, t), that extends the standard graph theoretical notion of radius, for considering all the ways in which t nodes may crash, and we present an algorithm that solves consensus in radius(G, t) rounds. Then we derive a lower bound showing that, among oblivious algorithms, our algorithm is optimal for a large family of graphs including all vertex-transitive graphs.\n\nThis is a joint work with Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy and Corentin Travers. \n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1141
LOCATION:
END:VEVENT
END:VCALENDAR