2924 search results - page 97 / 585 » Lower Bounds in Distributed Computing |
FOCS
1999
IEEE
14 years 3 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We consider the problem of information embedding where the encoder modifies a white Gaussian host signal in a power-constrained manner to encode the message, and the decoder recov...
TIT
2010
13 years 5 months ago
2010
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...
PODC
2009
ACM
14 years 6 months ago
2009
ACM
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...
ICPADS
1998
IEEE
14 years 3 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...