9 search results - page 1 / 2 » Analysis of the Expected Number of Bit Comparisons Required ... |
ALGORITHMICA
2010
13 years 4 months ago
2010
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Significant progress in the design of special purpose hardware for supporting the Number Field Sieve (NFS) has been made. From a practical cryptanalytic point of view, however, no...
CARDIS
2010
Springer
13 years 11 months ago
2010
Springer
At ACISP 2004, Giraud and Knudsen presented the first fault analysis of DSA, ECDSA, XTR-DSA, Schnorr and ElGamal signatures schemes that considered faults affecting one byte. The...