Titlebook: Structural Information and Communication Complexity; 14th International C Giuseppe Prencipe,Shmuel Zaks Conference proceedings 2007 Springe

braggadocio

Fast Periodic Graph Exploration with Constant Memory a constant number of states (memory bits), must be able to explore any unknown anonymous graph. The nodes in the graph are neither labelled nor colored. However, while visiting a node . the robot can distinguish between edges incident to it. The edges are ordered and labelled by consecutive integer

冷淡一切

使人煩燥

Graph Searching with Advicet number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching problem in a distributed setting. In this variant of the problem, all searchers are ini

原諒

From Renaming to Set Agreementthe size . depends on the number of processes that want to acquire a new name (and not on the total number . of processes). Assuming each process proposes a value, the .-set agreement problem allows each process to decide a proposed value in such a way that at most . different values are decided. In

禍害隱伏

assail

corn732

Labeling Schemes with Queriesven to any two vertices . and . for some function . (e.g. “distance(.,.)”) one can compute the function (e.g. the graph distance between . and .). Some very involved lower bounds for the sizes of the labels were proven..In this paper, we demonstrate that such lower bounds are very sensitive to the n

BACLE

Truculent

Data Aggregation in Sensor Networks: Balancing Communication and Delay Costsare highly energy constrained. Data aggregation can be used to combine data of several sensors into a single message, thus reducing sensor communication costs at the expense of message delays. Thus, the main problem of data aggregation is to balance the communication and delay costs..In this paper w

解凍

Optimal Moves for Gossiping Among Mobile Agentsd system and carry out a task at each node. In such mobile-agent-based systems, . is the most fundamental scheme supporting cooperation among mobile agents. It requires to accomplish all-to-all information exchange over all agents so that each agent can obtain the all information each agent initiall