In this paper, we study the completion and the termination time of distributed protocols for both the (single) broadcast and the multi-broadcast operations on unknown networks as functions of the number of nodes n, the maximum eccentricity Δ, and the congestion c of the networks.Expand

Selective families, a weaker variant of superimposed codes [KS64, F92, 197, CR96], have been recently used to design Deterministic Distributed Broadcast (DDB) protocols for unknown radio networks (a radio network is said to be unknown when the nodes know nothing about the network but their own label) .Expand

We introduce stochastic time-dependency in evolving graphs: starting from an arbitrary initial edge probability distribution, at every time step, every edge changes its state (existing or not) according to a two-state Markovian process with probabilities p (edge birth-rate) and q (edge death-rate).Expand

We consider the following generalization of the popular “15 puzzle.” Let T be a tree with n vertices and with k distinct pebbles numbered 1, ..., k on distinct vertices.Expand

We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its node-expansion properties.Expand

We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its node-expansion properties and apply it to a class of concrete mobile networks.Expand

PURPOSE
Development of user-friendly tools for the prediction of single-patient probability of late rectal toxicity after conformal radiotherapy for prostate cancer.
METHODS AND MATERIALS
This… Expand

We present an algorithm that, on input two arrangements of k pebbles on a tree with n vertices, decides in time O(n) whether the two arrangements are reachable from one another.Expand