168 search results - page 20 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
140
Voted
COCO
2008
Springer
15 years 3 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
136
Voted
JOC
2007
15 years 1 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
ICPADS
1998
IEEE
15 years 6 months ago
1998
IEEE
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
143
Voted
ICITS
2009
14 years 11 months ago
2009
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
115
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...