608 search results - page 41 / 122 » On Dependent Randomized Rounding Algorithms |
100
Voted
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
113
click to vote
LATINCRYPT
2010
14 years 11 months ago
2010
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
128
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
134
Voted
IMCSIT
2010
14 years 10 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
90
Voted
ANTS
2004
Springer
15 years 5 months ago
2004
Springer
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...