The Bit Complexity of Distributed Sorting

被引：0

|

作者：

Gerstel, O.

Zaks, S.

机构：

[1] Optical Networking Group, Tellabs Operations, c/o IBM T.J. Watson Research Center, 30 Saw Mill River Road, Hawthorne, NY 10532, United States

[2] Department of Computer Science, Technion, Haifa, Israel

来源：

Algorithmica (New York) | 1997年 / 18卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：405 / 416

相关论文

共 50 条

[31] Complexity of a Car Sorting Algorithm
Romanovsky, J. V.
Rzhevskaya, E. E.
VESTNIK ST PETERSBURG UNIVERSITY-MATHEMATICS, 2015, 48 (02) : 99 - 101
[32] On the Upper Bound of the Complexity of Sorting
I. S. Sergeev
Computational Mathematics and Mathematical Physics, 2021, 61 : 329 - 346
[33] COMPLEXITY OF SORTING BY DISTRIBUTIVE PARTITIONING
JACKOWSKI, BL
KUBIAK, R
SOKOLOWSKI, S
INFORMATION PROCESSING LETTERS, 1979, 9 (02) : 101 - 101
[34] Sorting out software complexity
Glass, RL
COMMUNICATIONS OF THE ACM, 2002, 45 (11) : 19 - 21
[35] PARALLEL COMPLEXITY OF SORTING PROBLEMS
AIGNER, M
JOURNAL OF ALGORITHMS, 1982, 3 (01) : 79 - 88
[36] On the Upper Bound of the Complexity of Sorting
Sergeev, I. S.
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2021, 61 (02) : 329 - 346
[37] LINEAR COMPLEXITY ASSERTIONS FOR SORTING
SAXENA, NR
MCCLUSKEY, EJ
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1994, 20 (06) : 424 - 431
[38] On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Extended Abstract)
Fontaine, Allyx
Metivier, Yves
Robson, John Michael
Zemmari, Akka
SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 235 - 245
[39] Low complexity bit by bit soft output demodulator
Fagervik, K
Jeans, TG
ELECTRONICS LETTERS, 1996, 32 (11) : 985 - 987
[40] ON THE BIT COMPLEXITY OF PARALLEL COMPUTATIONS
AKL, SG
MEIJER, H
INTEGRATION-THE VLSI JOURNAL, 1988, 6 (02) : 201 - 212

← 1 2 3 4 5 →