We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
Julien M. Hendrickx, Alexander Olshevsky, John N. ...
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Mobile peer-to-peer groups, which do not require any pre-deployed infrastructure or trusted centralized authority are valuable for a variety of collaborative applications. This wor...
Recently, as more and more social network data has been published in one way or another, preserving privacy in publishing social network data becomes an important concern. With som...