We consider the bit-complexity i.e.a, total number of bits transmitted of computing boolean functions on an anonymous canonically labeled n-dimensional hypercube network and give a characterization of the boolean functions computable on such a network as exactly those boolean functions which are inv
โฆ LIBER โฆ
Distributed computing on regular networks with anonymous nodes
โ Scribed by Lakshman, T.V.; Wei, V.K.
- Book ID
- 119772152
- Publisher
- IEEE
- Year
- 1994
- Tongue
- English
- Weight
- 895 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0018-9340
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Distributed Computing on Anonymous Hyper
โ
Evangelos Kranakis; Danny Krizanc
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 245 KB
Reliability evaluation for distributed c
โ
Wei-Jenn Ke; Sheng-De Wang
๐
Article
๐
1997
๐
IEEE
๐
English
โ 864 KB
Computing on anonymous networks with sen
โ
Paola Flocchini; Alessandro Roncato; Nicola Santoro
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 358 KB
Sense of direction refers to a set of global consistency constraints of the local labeling of the edges of a network. Sense of direction has a large impact on the communication complexity of many distributed problems. In this paper, we study the impact that sense of direction has on computability an
Distributed computing on oriented anonym
โ
Evangelos Kranakis; Nicola Santoro
๐
Article
๐
2001
๐
Springer-Verlag
๐
English
โ 85 KB
Computing Boolean Functions on Anonymous
โ
E. Kranakis; D. Krizanc; J. Vandenberg
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 1016 KB
Computing functions on asynchronous anon
โ
M. Yamashita
๐
Article
๐
1998
๐
Springer
๐
English
โ 14 KB