Introspective sorting and selection algorithms

被引：0

作者：

Musser, David R. ^{[1
]}

机构：

[1] Rensselaer Polytechnic Inst, Troy, NY, United States

来源：

Software - Practice and Experience | 1997年 / 27卷 / 08期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：983 / 993

共 50 条

[1] Introspective sorting and selection algorithms
Musser, DR
SOFTWARE-PRACTICE & EXPERIENCE, 1997, 27 (08): : 983 - 993
[2] Introspective sorting and selection revisited
Valois, JD
SOFTWARE-PRACTICE & EXPERIENCE, 2000, 30 (06): : 617 - 638
[3] Streaming algorithms for selection and approximate sorting
Karp, Richard M.
FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 9 - 20
[4] PROBABILISTIC PARALLEL ALGORITHMS FOR SORTING AND SELECTION
REISCHUK, R
SIAM JOURNAL ON COMPUTING, 1985, 14 (02) : 396 - 409
[5] PROBABILISTIC PARALLEL ALGORITHMS FOR SORTING AND SELECTION.
Reischuk, Ruediger
1600, (14):
[6] Sorting-Based Selection Algorithms for Hypercubic Networks
P. Berthomé
A. Ferreira
B. M. Maggs
S. Perennes
C. G. Plaxton
Algorithmica, 2000, 26 : 237 - 254
[7] Scalable algorithms for the mesh with buses: Merging, sorting and selection
Ramnath, S
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1998, 69 (1-2) : 17 - 32
[8] Sorting-based selection algorithms for hypercubic networks
Berthomé, P
Ferreira, A
Maggs, BM
Perennes, S
Plaxton, CG
ALGORITHMICA, 2000, 26 (02) : 237 - 254
[9] The performance of a selection of sorting algorithms on a general purpose parallel computer
Dowsing, RD
Martins, WS
CONCURRENCY-PRACTICE AND EXPERIENCE, 1998, 10 (04): : 315 - 332
[10] COMPARISON OF SORTING ALGORITHMS
EARLY, GG
TEXAS JOURNAL OF SCIENCE, 1978, 30 (03): : 227 - 232