1778 search results - page 1 / 356 » On the Power of the Randomized Iterate |
ASPDAC
2009
ACM
13 years 11 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
We consider two of the most fundamental theorems in Cryptography. The first, due to H
ASPDAC
2007
ACM
13 years 8 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
We look at iterated power generators si = se i−1 mod N for a random seed s0 ∈ ZN that in each iteration output a certain amount of bits. We show that heuristically an output of...
AAAI
2011
12 years 4 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...