Titlebook: Structural Information and Communication Complexity; 22nd International C Christian Scheideler Conference proceedings 2015 Springer Interna

prediabetes

Node Labels in Local Decision, computing environment—in particular, they provide some nodes with information related to the size of the network. It was recently proved that in the context of ., there are some decision problems such that (1) they cannot be solved without unique identifiers, and (2) unique node identifiers leak a

adduction

Exact Bounds for Distributed Graph Colouring, by prior work it is known that we can find a proper 3-colouring in . communication rounds. We close the gap between upper and lower bounds: we show that for infinitely many . the time complexity is precisely . communication rounds.

使激动

不公开

Scheduling Multipacket Frames with Frame Deadlines,riodic fashion, and compete on allocation of transmission slots. A frame is deemed useful only if all its packets are delivered before its deadline. Using standard techniques, one can derive polylog-competitive algorithms for this model; in this paper we study special cases which allow for better re

CAB

cliche

preservative

Optimizing Spread of Influence in Social Networks via Partial Incentives, = (.,.), representing the network, initially . the members of a given . ⊆ . are influenced; subsequently, at each round, the set of influenced nodes is augmented by all the nodes in the network that have a sufficiently large number of already influenced neighbors. The general problem is to find a s

连累

FLAT

,Simple Distributed Δ + 1 Coloring in the SINR Model,chedules. For networks with maximum degree Δ, a Δ + 1 coloring is the ultimate goal in the distributed setting as this is always possible. In this work we propose a very simple 4Δ coloring along with a color reduction technique to achieve Δ + 1 colors. All algorithms have a runtime of . time slots.

袋鼠