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 β¦
Survey on anonymous communications in computer networks
β Scribed by Jian Ren; Jie Wu
- Book ID
- 108100851
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 303 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0140-3664
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
Computing functions on asynchronous anon
β
M. Yamashita
π
Article
π
1998
π
Springer
π
English
β 14 KB
Anonymous Communication in Ubiquitous Co
β
Min-Ho Park; Ju-Hyung Son; Seung-Woo Seo
π
Article
π
2009
π
Springer US
π
English
β 539 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
Communication control in computer networ
β
Josef PuΕΎman; Radoslav PoΕΓzek
π
Article
π
1981
π
Elsevier Science
β 137 KB
ARMR: Anonymous routing protocol with mu
β
Ying Dong; Tat Wing Chim; Victor O.K. Li; S.M. Yiu; C.K. Hui
π
Article
π
2009
π
Elsevier Science
π
English
β 585 KB