Search citation statements

Paper Sections

Select...

2

1

1

Citation Types

0

10

0

Year Published

2011

2014

Publication Types

Select...

1

1

Relationship

0

2

Authors

Journals

(10 citation statements)

(10 reference statements)

0

10

0

“…Redistribute the messages evenly such that all nodes store (up to one) the same amount. 11 3. Announce to each node the number of messages for it you currently hold.…”

confidence: 99%

“…Redistribute the messages evenly such that all nodes store (up to one) the same amount. 11 3. Announce to each node the number of messages for it you currently hold.…”

confidence: 99%

“…To each node, forward one copy of a message destined for it (if any has been received in the previous step; if multiple copies have been received, any choice is feasible) and confirm the delivery to the previous sender. 11 Since all nodes are aware of the number of messages the other nodes have, this can be solved deterministically in one round: E.g., order the messages…”

mentioning

confidence: 99%

“…Therefore, in this section we discuss several combinations of parameters we consider of particular interest. To round off the presentation, we make a best effort at a fair comparison to algorithms from the literature; the relevant candidates here are variants of the Greedy algorithm [1,4] and Stemann's collision algorithm [8].…”

confidence: 99%

“…In [4], the authors propose an adaptive variant of the multi-round Greedy algorithm called Hretry that runs for 3 rounds. After running an initial round of the multi-round Greedy algorithm with d = 2 in the first round and trying to resolve conflicts in the second round, balls that are still unsuccessful contact 2 additional bins in the third round.…”

confidence: 99%