We study several variants of coordinated consensus in dynamic networks. We assume a
synchronous model, where the communication graph for each round is chosen by a worst …

We define a reliable neighbor discovery layer for mobile adhoc networks and present two
algorithms that implement this layer as a service with varying progress guarantees. Our …

This paper investigates distributed Dominating Set (DS) and Connected Dominating Set
(CDS) construction in dynamic wireless networks under the SINR interference model …

We study lower bounds on information dissemination in adversarial dynamic networks.
Initially, k pieces of information (henceforth called tokens) are distributed among n nodes …

The consensus problem is a fundamental paradigm in distributed systems, because it
captures the difficulty to solve other agreement problems. Many current systems evolve with …

Starting with with work of Michail et al., the problem of Counting the number of nodes in
Anonymous Dynamic Networks has attracted a lot of attention. The problem is challenging …

How to reach consensus on an average value in a dynamic crowd without revealing
identity? In this work, we study the problem of Average Network Consensus in Anonymous …

Counting the number of nodes in Anonymous Dynamic Networks is enticing from an
algorithmic perspective: an important computation in a restricted platform with promising …

This paper introduces the concept of metaphorical structure as a way of conciliating user
interface development by demonstration and by generation so that advantages of both …

Résumé The journey recounted in this document spanned a period of about 10 years, from
the end of the PhD (2007) to current (early 2018). The rst ve years correspond to two …