BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260416T160718Z
UID:Seminar-NESTiD-1140@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Othon Michail:MAILTO:Othon.Michail@liverpool.ac.uk
DTSTART:20211014T130000
DTEND:20211014T140000
SUMMARY:Durham-Liverpool synergy Series
DESCRIPTION:Paul Spirakis: Actively Dynamic Networks\n\nWe discuss here systems of (distributed) entities that can actively modify their communication network. We focus on two broad issues : (a) distributed algorithms that can reconfigure a network to carry out a given task efficiently, (b) creating a desired network starting from a single entity and allowing entities (nodes) to self-replicate (and thus expand) the network and its size. Such issues lead to a natural balance between how fast (time) and how efficiently (number of link activations, number of excess links to be eventually deleted) a target network can be generated. Our results include lower bounds and algorithms that try to balance speed and efficiency.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1140
LOCATION:
END:VEVENT
END:VCALENDAR