Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

WDAG
2001
Springer

favoriteEmaildiscussreport

76views Algorithms» more WDAG 2001»

An Effective Characterization of Computability in Anonymous Networks

13 years 9 months ago

An Effective Characterization of Computability in Anonymous Networks

Download vigna.dsi.unimi.it

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, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, interleaved).

Paolo Boldi, Sebastiano Vigna

Real-time Traffic

Algorithms | Characterizations | Network Size | WDAG 2001 |

claim paper

Related Content

» Computing Vector Functions on Anonymous Networks

» Data Caching for Enhancing Anonymity

» Computing Anonymously with Arbitrary Knowledge

» On the effectiveness of low latency anonymous network in the presence of timing attack

» Edge Anonymity in Social Network Graphs

» Detecting and characterizing social spam campaigns

» Distributed anonymous discrete function computation

» The role of network trace anonymization under attack

» SAT A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	WDAG
Authors	Paolo Boldi, Sebastiano Vigna

Comments (0)