On monday, at 2pm - UPEC CMC - Room P2-131

March 23, 2020

TBA

Barnaby Martin (Durham)

TBA

March 9, 2020

TBA

Jean Marie Madiot (INRIA Paris)

TBA

February 24, 2020

TBA

Alexis Bes (LACL - UPEC)

TBA

February 3, 2020

Network Inference: Graph reconstruction and verification

Hang Zhou (LIX - Polytechnique)

How efficiently can we find an unknown graph using shortest path queries between its vertices? This is a natural theoretical question from the standpoint of recovery of hidden information. This question is related to discovering the topology of Internet networks, which is a crucial step for building accurate network models and designing efficient algorithms for Internet applications.

In this talk, I will introduce the problems of graph reconstruction and verification via oracles. I will investigate randomized algorithms based on a Voronoi cell decomposition. I will also analyze greedy algorithms, and prove that they are near-optimal.

The talk is based on joint work with Claire Mathieu and Sampath Kannan.

January 20, 2020

TBA

Samuel Petite (LAMFA - Université de Picardie)

January 13, 2020

TBA

Yann Strozecki (Laboratoire DAVID )

TBA