8 search results - page 2 / 2 » On the OBDD complexity of the most significant bit of intege... |
ASIACRYPT
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
ASPLOS
2009
ACM
14 years 9 months ago
2009
ACM
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...