Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

RSA
2002

favoriteEmaildiscussreport

161views more RSA 2002»

Asymptotic analysis of (3, 2, 1)-shell sort

13 years 4 months ago

Asymptotic analysis of (3, 2, 1)-shell sort

Download www.stat.washington.edu

: We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.

Robert T. Smythe, J. A. Wellner

Real-time Traffic

Random Struct | RSA 2002 | Usual Random Permutation | Wiley Periodicals |

claim paper

Related Content

» Exact Asymptotics of DivideandConquer Recurrences

» Asymptotic Ergodic Capacity of Multidimensional VectorSensor Array MIMO Channels

» Oblivious RAM Revisited

» Multiway InPlace Merging

» Universal Asymptotics for Random Tries and PATRICIA Trees

» Analysis of the Expected Number of Bit Comparisons Required by Quickselect

» Better approximation algorithms for bin covering

» Artificial neural networks and multicriterion analysis for sustainable irrigation planning

» Methods for simultaneously identifying coherent local clusters with smooth global patterns...

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	RSA
Authors	Robert T. Smythe, J. A. Wellner

Comments (0)