7 search results - page 1 / 2 » Sieving Using Bucket Sort |
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
This paper proposes a new sieving algorithm that employs a bucket sort as a part of a factoring algorithm such as the number field sieve. The sieving step requires an enormous num...
EGH
2011
Springer
12 years 5 months ago
2011
Springer
We present a highly flexible and efficient software pipeline for programmable triangle voxelization. The pipeline, entirely written in CUDA, supports both fully conservative and ...
IACR
2011
12 years 4 months ago
2011
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes...
ACSC
2007
IEEE
13 years 11 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
IEEEPACT
1999
IEEE
13 years 9 months ago
1999
IEEE
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...