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 条
  • [21] THE DISTRIBUTED BIT COMPLEXITY OF THE RING - FROM THE ANONYMOUS TO THE NON-ANONYMOUS CASE
    BODLAENDER, HL
    MORAN, S
    WARMUTH, MK
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 58 - 67
  • [22] ON THE COMPLEXITY OF TOPOLOGICAL SORTING
    TODA, S
    INFORMATION PROCESSING LETTERS, 1990, 35 (05) : 229 - 233
  • [23] THE VLSI COMPLEXITY OF SORTING
    THOMPSON, CD
    IEEE TRANSACTIONS ON COMPUTERS, 1983, 32 (12) : 1171 - 1184
  • [24] THE COMPLEXITY OF PARALLEL SORTING
    DERHEIDE, FMA
    WIGDERSON, A
    SIAM JOURNAL ON COMPUTING, 1987, 16 (01) : 100 - 107
  • [25] Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
    Fontaine, A.
    Metivier, Y.
    Robson, J. M.
    Zemmari, A.
    INFORMATION AND COMPUTATION, 2013, 233 : 32 - 40
  • [26] ON THE NOTION OF BIT COMPLEXITY
    Toran, Jacobo
    Diem, Claus
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2011, (103): : 35 - 52
  • [27] Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm
    Metivier, Y.
    Robson, J. M.
    Saheb-Djahromi, N.
    Zemmari, A.
    PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009, 5923 : 359 - 364
  • [28] The Complexity of Bit Retrieval
    Elser, Veit
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (01) : 412 - 428
  • [29] DISTRIBUTED SORTING.
    Rotem, Doron
    Santoro, Nicola
    Sidney, Jeffrey B.
    1985, (C-34)
  • [30] Adaptive distributed sorting
    Alari, G
    Bourgon, B
    Chacko, J
    Datta, AK
    CONFERENCE PROCEEDINGS OF THE 1996 IEEE FIFTEENTH ANNUAL INTERNATIONAL PHOENIX CONFERENCE ON COMPUTERS AND COMMUNICATIONS, 1996, : 1 - 7
12345