1923 search results - page 84 / 385 » Modeling Complexity in Secure Distributed Computing |
119
click to vote
SODA
2012
ACM
13 years 6 days ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
116
click to vote
MOBICOM
2006
ACM
15 years 3 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
CISIS
2009
IEEE
15 years 4 months ago
2009
IEEE
— JXTA defines a set of six core protocols specifically suited for ad hoc, pervasive, multi-hop, peer-to-peer (P2P) computing. These protocols allow peers to cooperate and form...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
The fast development of the Web provides new ways for effective distribution of network-based digital goods. A digital marketplace provides a platform to enable Web users to effec...
CCS
2007
ACM
15 years 4 months ago
2007
ACM
We consider the effect attackers who disrupt anonymous communications have on the security of traditional high- and low-latency anonymous communication systems, as well as on the...