BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20151025T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20160327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.7197.field_data.0@diag.uniroma1.it
DTSTAMP:20260406T215902Z
CREATED:20151123T130649Z
DESCRIPTION:Computing systems and networks are more and more becoming dynam
 ic. The static and relatively stable models of computation can no longer r
 epresent a plethora of rapidly emerging new technologies. In recent years\
 , we have seen a tremendous increase in the number of new mobile computing
  devices. Even the Internet has become mobile. Traditional approached have
  usually considered causes of dynamicity\, such as failures\, that induce 
 a low rate of (temporary) topological changes. This is unsuitable for reas
 oning about truly dynamic networks\, which may change at a very high rate 
 and in a worst-case manner. Even graph-theoretic techniques need to be rev
 isited: the suitable graph model is now that of a temporal graph\, which\,
  in the discrete case\, may be viewed as a time-sequence of static graphs.
  Though static graphs have been extensively studied\, for their temporal g
 eneralization we are still far from having a concrete set of structural an
 d algorithmic principles. Additionally\, it is not yet clear how is the co
 mplexity of combinatorial optimization problems affected by introducing to
  them a notion of time.In this talk\, we will survey our and others resear
 ch in the fascinating and steadily growing area of dynamic networks. We wi
 ll cover two equally important sub-areas: (i) distributed models and algor
 ithms for dynamic networks and (ii) structural and algorithmic properties 
 of temporal graphs. In the distributed computing part\, we will begin by d
 iscussing the population protocol model (one of the first models in this a
 rea)\, which has served as a quite general model of computation in dynamic
  environments\, as a model of distributed construction of networks and sha
 pes\, and which is related to chemical and algorithmic self-assembly model
 s. Then we will revisit classical distributed tasks\, like counting\, nami
 ng\, and information dissemination\, in worst-case dynamic networks. Final
 ly\, we will turn our attention to the underlying model of temporal graphs
 . We will prove a temporal analogue of Menger's theorem\, we will discuss 
 the problem of designing an 'efficient' temporal graph\, given some requir
 ements that the graph should meet\, and we will touch on (algorithms and c
 omplexity of) temporal versions of classical graph problems. Bio: Othon Mi
 chail is a Senior Researcher in the RU1 of the Computer Technology Institu
 te (CTI) and an Adjunct Faculty at the University of Patras. He is the CI 
 and Project Manager of project FOCUS (2012-2015)\, which is a regional gra
 nt for excellence in science and technology and studies the foundations of
  dynamic distributed systems and networks. He has also worked as a key res
 earcher in several high-quality EU FET/FP7 research projects\, such as FRO
 NTS and VITRO. He is one of the authors of the book 'New Models for Popula
 tion Protocols' appearing in a series edited by Prof. Nancy Lynch (MIT). H
 is research interests include Distributed and Mobile Computing\, Modeling 
 and Analyzing novel ICT systems\, Theory of Computation\, and Design and A
 nalysis of Algorithms. He has been a PC Member of the international confer
 ences ACM PODC 2015 and CIAC 2013.
DTSTART;TZID=Europe/Paris:20151125T140000
DTEND;TZID=Europe/Paris:20151125T140000
LAST-MODIFIED:20151124T130700Z
LOCATION:Aula Magna DIAG\, via Ariosto 25\, I floor
SUMMARY:Othon Michail: Foundations of Dynamic Networks - November 25th @DIA
 G -
URL;TYPE=URI:http://diag.uniroma1.it/node/7197
END:VEVENT
END:VCALENDAR