id:"swepub:oai:DiVA.org:uu-26996"
Search: id:"swepub:oai:DiVA.org:uu-26996" > Shellsort with thre...
- 1 of 1
- Previous record
- Next record
- To hitlist
Shellsort with three increments
-
- Janson, S (author)
- Uppsala universitet
-
- Knuth, DE (author)
- Uppsala universitet
- (creator_code:org_t)
- JOHN WILEY & SONS LTD, 1997
- 1997
- English.
- In: RANDOM STRUCTURES & ALGORITHMS. - : JOHN WILEY & SONS LTD. ; 10:1-2, s. 125-142
- Journal article (other academic/artistic)
Abstract
Subject headings
Close
- 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
Publication and Content Type
- vet (subject category)
- art (subject category)
Find in a library
- RANDOM STRUCTURES & ALGORITHMS (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- Articles in the publication
- RANDOM STRUCTURE ...
- By the university
- Uppsala University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
