๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing Boolean Functions on Anonymous Networks

โœ Scribed by E. Kranakis; D. Krizanc; J. Vandenberg

Book ID
112252106
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
1016 KB
Volume
114
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Distributed Computing on Anonymous Hyper
Distributed Computing on Anonymous Hypercube Networks
โœ Evangelos Kranakis; Danny Krizanc ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 245 KB

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

Computing preimages of Boolean networks
Computing preimages of Boolean networks
โœ Klotz, Johannes; Bossert, Martin; Schober, Steffen ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› BioMed Central ๐ŸŒ English โš– 265 KB
Computing on anonymous networks with sen
Computing on anonymous networks with sense of direction
โœ 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