AN OPTIMAL-TIME ALGORITHM FOR SLOPE SELECTION

被引：86

作者：

COLE, R

SALOWE, JS

STEIGER, WL

SZEMEREDI, E

机构：

[1] UNIV VIRGINIA,DEPT COMP SCI,CHARLOTTESVILLE,VA 22903

[2] RUTGERS STATE UNIV,DEPT COMP SCI,NEW BRUNSWICK,NJ 08903

[3] HUNGARIAN ACAD SCI,INST MATH,H-1361 BUDAPEST 5,HUNGARY

来源：

SIAM JOURNAL ON COMPUTING | 1989年 / 18卷 / 04期

关键词：

D O I：

10.1137/0218055

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：792 / 810

页数：19

共 13 条

[1] SORTING IN C LOG N PARALLEL STEPS [J].

AJTAI, M ;

KOMLOS, J ;

SZEMEREDI, E .

COMBINATORICA, 1983, 3 (01) :1-19

[2]

BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432

[3]

Blum M., 1973, Journal of Computer and System Sciences, V7, P448, DOI 10.1016/S0022-0000(73)80033-9

[4]

Chazelle B., 1985, P ACM S COMPUTATIONA, P125

[5] SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS [J].

COLE, R .

JOURNAL OF THE ACM, 1987, 34 (01) :200-208

[6]

Knuth D. E, 1998, SORTING SEARCHING AR, V3

[7] APPLYING PARALLEL COMPUTATION ALGORITHMS IN THE DESIGN OF SERIAL ALGORITHMS [J].

MEGIDDO, N .

JOURNAL OF THE ACM, 1983, 30 (04) :852-865

[8]

Preparata F. P., 2012, COMPUTATIONAL GEOMET

[9] LINEAR SELECTION ALGORITHM FOR SETS OF ELEMENTS WITH WEIGHTS [J].

REISER, A .

INFORMATION PROCESSING LETTERS, 1978, 7 (03) :159-162

[10]

SALOWE J, 1987, THESIS RUTGERS U NEW

← 1 2 →