uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Shellsort with three increments
Uppsala University.
Uppsala University.
1997 (English)In: RANDOM STRUCTURES & ALGORITHMS, Vol. 10, no 1-2, 125-142 p.Article in journal (Other scientific) Published
Abstract [en]

A perturbation technique can be used to simplify and sharpen A. C. Yao's theorems about the behavior of shellsort with increments (h,g,1). In particular, when h = Theta(n(7/15)) and g = Theta(h(1/5)), the running time is O(n(23/15)). The proof involves in

Place, publisher, year, edition, pages
JOHN WILEY & SONS LTD , 1997. Vol. 10, no 1-2, 125-142 p.
URN: urn:nbn:se:uu:diva-26996OAI: oai:DiVA.org:uu-26996DiVA: diva2:54890
Addresses: STANFORD UNIV, DEPT COMP SCI, STANFORD, CA 94305. UPPSALA UNIV, DEPT MATH, S-75106 UPPSALA, SWEDEN.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-15

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

Total: 113 hits
ReferencesLink to record
Permanent link

Direct link