2084 search results - page 163 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
200
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
179
Voted
EUROCRYPT
2010
Springer
16 years 7 days ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
223
Voted
EUROPAR
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
190
Voted
GD
2009
Springer
16 years 1 days ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
230
Voted
DSN
2007
IEEE
15 years 11 months ago
2007
IEEE
Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-topeer traffic inc...