Titlebook: Structural Information and Communication Complexity; 19th International C Guy Even,Magnús M. Halldórsson Conference proceedings 2012 Spring

ODIUM

Wireless Network Stability in the SINR Model,uted algorithm that achieves .-efficiency on all networks (where . is the number of links in the network), for all length monotone, sub-linear power assignments. For the power control version of the problem, we give a distributed algorithm with .-efficiency (where Δ is the length diversity of the link set).

generic

Early Deciding Synchronous Renaming in ,( log, ) Rounds or Less,e execution. We show that, surprisingly, renaming can be solved in . time if the number of failures . is limited to ., while for general . ≤ . − 1 renaming can always be solved in .( log. ) communication rounds. In the wait-free case, i.e. for . = . − 1, our upper bounds match the Ω( log. ) lower bound of Chaudhuri et al. [13].

EPT

Homonyms with Forgeable Identifiers, if . > 2. + ...Moreover we extend this result to systems with authentication by signatures in which at most . signatures are forgeable and we prove that Byzantine Agreement problem is solvable if and only if . > . + ..

mechanical

弄皱

0302-9743 national Colloquium on Structural Information and Communication Complexity, SIROCCO 2012, held in Reykjavik, Iceland for 3 days starting June 30, 2012. The 28 revised full papers presented were carefully reviewed and selected from 54 submissions. SIROCCO is devoted to the study of communication and

在驾驶

Space Lower Bounds for Low-Stretch Greedy Embeddings,hs..In this paper, we show that greedy embeddings in low-dimensional Euclidean spaces necessarily have high stretch. In particular, greedy embeddings of .-node graphs with optimal stretch requires at least Ω(.) dimensions for distance ℓ.. This result disproves a conjecture by Maymounkov (2006) stati

抓住他投降

无畏

Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring,istributed algorithms for scheduling problems, we can choose virtually any trade-off between the following three parameters: ., the running time of the algorithm, ℓ, the length of the schedule, and ., the maximum number of periods of activity for a any single node. Here ℓ is the objective function o

极微小

An Algorithm for Online Facility Leasing,n algorithm for the offline problem and an . (.log.)-competitive algorithm for the online variant. Here, . denotes the total number of clients arriving over time. We extend their result by removing the dependency on . (and thereby on the time). In general, our algorithm is .-competitive. Here . deno

运动的我