1612 search results - page 34 / 323 » Analysing Randomized Distributed Algorithms |
130
click to vote
IPTPS
2003
Springer
15 years 7 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...
109
click to vote
SCN
2008
Springer
15 years 2 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...
106
click to vote
APJOR
2010
15 years 14 days 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...
115
click to vote
WCE
2007
15 years 3 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...
114
click to vote
COCO
2006
Springer
15 years 5 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...