Sciweavers

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

13

ICALP
1999
Springer

favoriteEmaildiscussreport

127views Programming Languages» more ICALP 1999»

Average-Case Complexity of Shellsort

13 years 9 months ago

Average-Case Complexity of Shellsort

Download homepages.cwi.nl

We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for average-case Shellsort. Categories and Subject Descriptors: E.4 [Coding and Information Theory]: data compaction and

Tao Jiang, Ming Li, Paul M. B. Vitányi

Real-time Traffic

Average-case Running Time | General Lower Bound | ICALP 1999 | Lower Bound | Programming Languages |

claim paper

Related Content

» Best Increments for the Average Case of Shellsort

» WorstCase Versus Average Case Complexity of RayShooting

» Tractability of tensor product problems in the average case setting

» On the Theory of Average Case Complexity

» AverageCase Quantum Query Complexity

» On the AverageCase Complexity of Property Testing

» Towards AverageCase Complexity Analysis of NP Optimization Problems

» Notions of AverageCase Complexity for Random 3SAT

» Structural Average Case Complexity

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	ICALP
Authors	Tao Jiang, Ming Li, Paul M. B. Vitányi

Comments (0)