EXPECTED TIME-COMPLEXITY OF A NEW CLASS OF DISTRIBUTIVE PARTITIONING SORT ALGORITHMS

被引：0

|

作者：

VANDERNAT, M

机构：

来源：

ANGEWANDTE INFORMATIK | 1987年 / 12期

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：533 / 536

页数：4

相关论文

共 20 条

[1] ANALYZING A CLASS OF DISTRIBUTIVE PARTITIONING SORT ALGORITHMS
VANDERNAT, M
VERRIJNSTUART, AA
SCIENCE OF COMPUTER PROGRAMMING, 1986, 7 (01) : 23 - 33
[2] ON THE AVERAGE TIME-COMPLEXITY OF SET PARTITIONING
SPECKENMEYER, E
KEMP, R
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 440 : 369 - 381
[3] RESERVOIR-SAMPLING ALGORITHMS OF TIME-COMPLEXITY O(N(1+LOG(N/N)))
LI, KH
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1994, 20 (04): : 481 - 493
[4] Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Hasan, Osman
Tahar, Sofiene
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2010, 25 (06) : 1305 - 1320
[5] Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Osman Hasan
Sofiène Tahar
Journal of Computer Science and Technology, 2010, 25 : 1305 - 1320
[6] Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Osman Hasan
Sofiène Tahar
Journal of Computer Science & Technology, 2010, 25 (06) : 1305 - 1320
[7] IMPROVING THE TIME-COMPLEXITY OF MESSAGE-OPTIMAL DISTRIBUTED ALGORITHMS FOR MINIMUM-WEIGHT SPANNING-TREES
CHIN, F
TING, HF
SIAM JOURNAL ON COMPUTING, 1990, 19 (04) : 612 - 626
[8] EXPECTED-TIME COMPLEXITY RESULTS FOR HIERARCHIC CLUSTERING ALGORITHMS WHICH USE CLUSTER CENTERS
MURTAGH, F
INFORMATION PROCESSING LETTERS, 1983, 16 (05) : 237 - 241
[9] A new approach to estimating the expected first hitting time of evolutionary algorithms
Yu, Yang
Zhou, Zhi-Hua
ARTIFICIAL INTELLIGENCE, 2008, 172 (15) : 1809 - 1832
[10] Low complexity decoding of a class of linear space-time block codes by subspace partitioning
Kuhn, M
Wittneben, A
IEEE 56TH VEHICULAR TECHNOLOGY CONFERENCE, VTC FALL 2002, VOLS 1-4, PROCEEDINGS, 2002, : 2182 - 2186