3415 search results - page 492 / 683 » Lower bounds on kernelization |
164
click to vote
TCC
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
155
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
158
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
165
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
150
click to vote
SIGMETRICS
2004
ACM
15 years 11 months ago
2004
ACM
Previous scalable protocols for downloading large, popular files from a single server include batching and cyclic multicast. With batching, clients wait to begin receiving a reque...