38 search results - page 1 / 8 » Asymptotic analysis of (3, 2, 1)-shell sort |
RSA
2002
13 years 4 months ago
2002
: We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.
ICALP
1993
Springer
13 years 9 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
TWC
2008
13 years 4 months ago
2008
Abstract--We analyze asymptotic ergodic capacity of multidimensional vector-sensor array MIMO (PMD-MIMO) channels established by the use of dual-polarized antennas in the form of 1...
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
FCT
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...