1729 search results - page 337 / 346 » On Bounds for the k-Partitioning of Graphs |
179
click to vote
INFOCOM
2007
IEEE
16 years 29 days ago
2007
IEEE
—In recent literature, network coding has emerged as a promising information theoretic approach to improve the performance of both peer-to-peer and wireless networks. It has been...
171
click to vote
CRYPTO
2007
Springer
16 years 25 days ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
189
click to vote
DSN
2006
IEEE
16 years 22 days ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
175
click to vote
INFOCOM
2006
IEEE
16 years 21 days ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
179
click to vote
SIGCOMM
2006
ACM
16 years 19 days ago
2006
ACM
Peer-to-peer and other decentralized, distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack, a malicious user obtains multiple fake ident...