Name
Abstract | ||
|---|---|---|
Given a network of processes ${\cal G}$, where each process has a fixed input bit, Input(x), the disjunction problem is for each process to compute $\mbox{\it Output\/}=\bigvee_{x\in{\cal G}}\mbox{\it Input\/}(x)$, the disjunction of all input bits in the network. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33536-5_5 | SSS |
Keywords | Field | DocType |
anonymous network,cal g,brief announcement,silent disjunction,disjunction problem,input bit,fixed input bit | Discrete mathematics,Algorithm,Mathematics | Conference |
Citations | PageRank | References |
1 | 0.35 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ajoy K. Datta | 1 | 369 | 35.83 |
| Stéphane Devismes | 2 | 192 | 25.74 |
| Lawrence L. Larmore | 3 | 859 | 109.15 |