ROUTING, MERGING, AND SORTING ON PARALLEL MODELS OF COMPUTATION

被引：171

作者：

BORODIN, A ^{[1
]}

HOPCROFT, JE ^{[1
]}

机构：

[1] CORNELL UNIV,DEPT COMP SCI,ITHACA,NY 14853

来源：

关键词：

D O I：

10.1016/0022-0000(85)90008-X

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：130 / 145

页数：16

共 30 条

[1]

Aleliunas R., 1982, P ACM S PRINCIPLES D, P60

[2]

BORODIN A, 1982, 14TH P ACM S THEOR C, P338

[3]

Chandra A. K., 1982, 23rd Annual Symposium on Foundations of Computer Science, P1, DOI 10.1109/SFCS.1982.3

[4]

Cook S.A., 1981, ENSEIGNEMENT MATH, VXXVII, P99

[5]

COOK SA, 1980, 21ST P ANN IEEE S F, P360

[6]

Furst M., 1981, 22nd Annual Symposium on Foundations of Computer Science, P260, DOI 10.1109/SFCS.1981.35

[7]

GALIL Z, 1981, 13TH P ANN ACM S THE, P247

[8]

Gottlieb A., 1981, Proceedings of the 1981 International Conference on Parallel Processing, P341

[9]

HAGGKVIST R, 1981, SIAM J COMPUT, V10, P465, DOI 10.1137/0210034

[10]

HAGGKVIST R, 1981, TR819 S FRAS U COMP