We call a network an anonymous network, if each vertex of the network is given no ID's. For distributed algorithms for anonymous networks, solvable problems depend strongly on the given initial conditions. In the past, initial conditions have been investigated, for example, by computation given the number of vertices as the initial condition, and in terms of what initial condition is needed to elect a leader. In this paper, we study the relations among initial conditions. To achieve this task, we define the relation between initial conditions A and B (denoted by A
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Naoshi SAKAMOTO, "Structure of Initial Conditions for Distributed Algorithms" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 12, pp. 2029-2038, December 2000, doi: .
Abstract: We call a network an anonymous network, if each vertex of the network is given no ID's. For distributed algorithms for anonymous networks, solvable problems depend strongly on the given initial conditions. In the past, initial conditions have been investigated, for example, by computation given the number of vertices as the initial condition, and in terms of what initial condition is needed to elect a leader. In this paper, we study the relations among initial conditions. To achieve this task, we define the relation between initial conditions A and B (denoted by A
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_12_2029/_p
Copy
@ARTICLE{e83-d_12_2029,
author={Naoshi SAKAMOTO, },
journal={IEICE TRANSACTIONS on Information},
title={Structure of Initial Conditions for Distributed Algorithms},
year={2000},
volume={E83-D},
number={12},
pages={2029-2038},
abstract={We call a network an anonymous network, if each vertex of the network is given no ID's. For distributed algorithms for anonymous networks, solvable problems depend strongly on the given initial conditions. In the past, initial conditions have been investigated, for example, by computation given the number of vertices as the initial condition, and in terms of what initial condition is needed to elect a leader. In this paper, we study the relations among initial conditions. To achieve this task, we define the relation between initial conditions A and B (denoted by A
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Structure of Initial Conditions for Distributed Algorithms
T2 - IEICE TRANSACTIONS on Information
SP - 2029
EP - 2038
AU - Naoshi SAKAMOTO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2000
AB - We call a network an anonymous network, if each vertex of the network is given no ID's. For distributed algorithms for anonymous networks, solvable problems depend strongly on the given initial conditions. In the past, initial conditions have been investigated, for example, by computation given the number of vertices as the initial condition, and in terms of what initial condition is needed to elect a leader. In this paper, we study the relations among initial conditions. To achieve this task, we define the relation between initial conditions A and B (denoted by A
ER -