Art
J-GLOBAL ID：200902015589030043   Reference number：92A0295069

The Worst Case Complexity or McDiarmid and Reed’s Variant of BOTTOM-UP HEAPSORT Is Less than nlogn+1.1n.

BOTTOM-UP HEAPSORTのMcDiarmid及びReedの変形の最悪複雑度はn log n+1.1n以下である
Author (1)：
WEGENER I

About WEGENER I

(Univ. Dortmund, Dortmund, DEU)

About Univ. Dortmund, Dortmund, DEU


Material：
Information and Computation  (Inf Comput)

About Information and Computation


Volume： 97  Issue： 1  Page： 86-96  Publication year： Mar. 1992 
JST Material Number： D0449A  ISSN： 0890-5401  CODEN： INFCEC  Document type： Article
Article type： 原著論文  Country of issue： Netherlands (NLD)  Language： ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
sorting(computer)

About sorting(computer)

,...
Semi thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
computational complexity

About computational complexity


   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=92A0295069&from=J-GLOBAL&jstjournalNo=D0449A") }}
JST classification (1)：
JST classification
Category name(code) classified by JST.
Theory of computation 
(JB02000A)

About Theory of computation

Terms in the title (2)：
Terms in the title
Keywords automatically extracted from the title.
Up

About Up

, 
複雑度

About 複雑度


Return to Previous Page

TOP

BOTTOM