1511 search results - page 276 / 303 » Randomness, lowness and degrees |
ICDCS
2010
IEEE
15 years 3 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
102
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
106
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
101
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
102
click to vote
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
This paper considers the problem of password-authenticated key exchange (PAKE) in a client-server setting, where the server authenticates using a stored password file, and it is de...