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 条
  • [1] The bit complexity of distributed sorting
    Gerstel, O
    Zaks, S
    ALGORITHMICA, 1997, 18 (03) : 405 - 416
  • [2] The Bit Complexity of Distributed Sorting
    O. Gerstel
    S. Zaks
    Algorithmica, 1997, 18 : 405 - 416
  • [3] THE COMPLEXITY OF SORTING ON DISTRIBUTED SYSTEMS
    LOUI, MC
    INFORMATION AND CONTROL, 1984, 60 (1-3): : 70 - 85
  • [4] The Round Complexity of Distributed Sorting [Extended Abstract]
    Patt-Shamir, Boaz
    Teplitsky, Marat
    PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 249 - 255
  • [5] Two absolute bounds for distributed bit complexity
    Dinitz, Y
    Solomon, N
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2005, 3499 : 115 - 126
  • [6] ON THE BIT COMPLEXITY OF DISTRIBUTED COMPUTATIONS IN A RING WITH A LEADER
    MANSOUR, Y
    ZAKS, S
    INFORMATION AND COMPUTATION, 1987, 75 (02) : 162 - 177
  • [7] Two absolute bounds for distributed bit complexity
    Dinitz, Yefim
    Solomon, Noam
    THEORETICAL COMPUTER SCIENCE, 2007, 384 (2-3) : 168 - 183
  • [8] Trading Bit, Message, and Time Complexity of Distributed Algorithms
    Schneider, Johannes
    Wattenhofer, Roger
    DISTRIBUTED COMPUTING, 2011, 6950 : 51 - 65
  • [9] Improving the Bit Complexity of Communication for Distributed Convex Optimization
    Ghadiri, Mehrdad
    Lee, Yin Tat
    Padmanabhan, Swati
    Swartworth, William
    Woodru, David P.
    Ye, Guanghao
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1130 - 1140
  • [10] An optimal bit complexity randomized distributed MIS algorithm
    Y. Métivier
    J. M. Robson
    N. Saheb-Djahromi
    A. Zemmari
    Distributed Computing, 2011, 23 : 331 - 340
12345