Sciweavers

60 search results - page 1 / 12
» Random Order m-ary Exponentiation
Sort
View
100
Voted
ACISP
2009
Springer
15 years 4 months ago
Random Order m-ary Exponentiation
This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than...
Michael Tunstall
83
Voted
CTRSA
2004
Springer
96views Cryptology» more  CTRSA 2004»
15 years 5 months ago
Self-Randomized Exponentiation Algorithms
Abstract. Exponentiation is a central process in many public-key cryptosystems such as RSA and DH. This paper introduces the concept of self-randomized exponentiation as an efficie...
Benoît Chevallier-Mames
87
Voted
ICALP
2007
Springer
15 years 5 months ago
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
Sudipto Guha, Andrew McGregor
82
Voted
CP
2000
Springer
15 years 4 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
83
Voted
APJOR
2010
118views more  APJOR 2010»
14 years 10 months ago
Alternative Randomization for Valuing American Options
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...
Toshikazu Kimura