Sciweavers

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

15

PODC
1999
ACM

favoriteEmaildiscussreport

92views Distributed and Parallel Com...» more PODC 1999»

Computing Anonymously with Arbitrary Knowledge

13 years 9 months ago

Computing Anonymously with Arbitrary Knowledge

Download vigna.dsi.unimi.it

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 (in particular, we do not assume that a bound on the network size is known). Three activation models are considered (synchronous, asynchronous, interleaved).

Paolo Boldi, Sebastiano Vigna

Real-time Traffic

Arbitrary Knowledge | Characterizations | Distributed And Parallel Computing | Network Size | PODC 1999 |

claim paper

Related Content

» Injector Mining Background Knowledge for Data Anonymization

» Linkability estimation between subjects and message contents using formal concepts

» Pseudo Trust ZeroKnowledge Based Authentication in Anonymous PeertoPeer Protocols

» Randomized selfstabilizing and space optimal leader election under arbitrary scheduler on ...

» Probabilistic Adaptive Anonymous Authentication in Vehicular Networks

» The Boundary Between Privacy and Utility in Data Publishing

» Anonymous Transactions in Computer Networks

» Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups

» Probabilistic Inference Protection on Anonymized Data

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	PODC
Authors	Paolo Boldi, Sebastiano Vigna

Comments (0)