1612 search results - page 34 / 323 » Analysing Randomized Distributed Algorithms |
IPTPS
2003
Springer
14 years 3 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
SCN
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We propose and analyse a new countermeasure against Differential Power Analysis (DPA) for the AES encryption algorithm, based on permutation tables. As opposed to existin...
APJOR
2010
13 years 8 months ago
2010
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
WCE
2007
13 years 11 months ago
2007
— This paper presents an important outcome of a research programme which focuses on the development of a method for synthesizing, under controlled conditions in the laboratory, t...
COCO
2006
Springer
14 years 1 months ago
2006
Springer
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...