Distrbuted Processing and Lower Bound of Message Complexity for Election Alogorithm in a Complete Network with Intermittent Faults
The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 11, pp. 2855-2861, Nov. 1998
10.3745/KIPSTE.1998.5.11.2855, PDF Download:
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[IEEE Style]
K. S. Dong, "Distrbuted Processing and Lower Bound of Message Complexity for Election Alogorithm in a Complete Network with Intermittent Faults," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 11, pp. 2855-2861, 1998. DOI: 10.3745/KIPSTE.1998.5.11.2855.
[ACM Style]
Kim Seong Dong. 1998. Distrbuted Processing and Lower Bound of Message Complexity for Election Alogorithm in a Complete Network with Intermittent Faults. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 11, (1998), 2855-2861. DOI: 10.3745/KIPSTE.1998.5.11.2855.