796 search results - page 66 / 160 » The Anonymous Subgraph Problem |
89
Voted
WDAG
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
WCNC
2008
IEEE
15 years 7 months ago
2008
IEEE
—Popularity of group-oriented applications motivates research on security and privacy protection for group communications. A number of group key agreement protocols exploiting ID...
90
Voted
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information...
135
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
200
Voted
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Location cloaking has been proposed and well studied to protect user privacy. It blurs the accurate user location (i.e., a point with coordinates) and replaces it with a well-shape...