198 search results - page 1 / 40 » An Effective Characterization of Computability in Anonymous ... |
WDAG
2001
Springer
13 years 9 months ago
2001
Springer
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
PODC
1997
ACM
13 years 9 months ago
1997
ACM
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
AINA
2011
IEEE
12 years 9 months ago
2011
IEEE
—The benefits of caching for reducing access time to frequently needed data, in order to improve system performance, are already well-known. In this paper, a proposal for employ...
PODC
1999
ACM
13 years 9 months ago
1999
ACM
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
DSN
2009
IEEE
14 years 15 hour ago
2009
IEEE
In this paper, we introduce a novel metric that can quantitatively measure the practical effectiveness (i.e. anonymity) of all anonymous networks in the presence of timing attack....