Sciweavers

2 search results - page 1 / 1
» N-Bit Unsigned Division via N-Bit Multiply-Add
Sort
View
ARITH
2005
IEEE
14 years 1 months ago
N-Bit Unsigned Division via N-Bit Multiply-Add
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
Arch D. Robison
26
Voted
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
14 years 7 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...