Agenda

13 Dic 2017 13:00

Exploration and graph searching problems in networks

Campus Scientifico via Torino - edificio ZETA, Sala Riunioni B

Euripides Markou, University of Thessaly

Abstract:
In this seminar we will discuss different problems in networks: The Black Hole Search problem in synchronous trees and graphs; the Black Hole Search problem and the rendezvous problem for weak agents (e.g., memoryless). We will show algorithms and discuss impossibility results, new directions and open problems.

Bio Sketch:
Euripides Markou is an Assistant Professor at the University of Thessaly. He got his Ph.D. in Computer Science in 2003 from the National University of Athens. His area of interest are in the field of distributed and geometric computing.

Lingua

L'evento si terrà in italiano

Organizzatore

ACADIA Research Centre

Cerca in agenda