2084 search results - page 311 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
100
click to vote
ASIACRYPT
2011
Springer
13 years 9 months ago
2011
Springer
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
100
click to vote
ALT
2005
Springer
15 years 6 months ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...