ON THE REARRANGEABILITY OF 2(LOG2 N) - 1 STAGE PERMUTATION NETWORKS.

被引：0
|
作者：
Le, Kyungsook Yoon [1 ]
机构：
[1] Ohio State Univ, Dep of Computer, & Information Science, Columbus,, OH, USA, Ohio State Univ, Dep of Computer & Information Science, Columbus, OH, USA
来源：
IEEE Transactions on Computers | 1985年 / C-34卷 / 05期
关键词：
D O I：
10.1109/tc.1985.1676581
中图分类号：
学科分类号：
摘要：
17
引用
收藏
页码：412 / 425
相关论文
共 50 条
  • [21] Wide-sense nonblocking multicast Log2 (N, m, p) networks
    Hwang, FK
    Lin, BC
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (10) : 1730 - 1735
  • [22] Nonblocking Multirate log2(N, m, p) Switching Networks with Multicast Connections
    Kabacinski, Wojciech
    Wichary, Tomasz
    NETWORKS, 2011, 57 (04) : 333 - 343
  • [23] Rearrangeability of (2 lognN− 1)-stage networks employing a uniform connection pattern
    R. Bashirov
    CALCOLO, 2001, 38 : 85 - 95
  • [24] TREVR: A general N log2 N radiative transfer algorithm
    Grond, J. J.
    Woods, R. M.
    Wadsley, J. W.
    Couchman, H. M. P.
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2019, 485 (03) : 3681 - 3695
  • [25] An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks
    Mamada, Satoko
    Uno, Takeaki
    Makino, Kazuhisa
    Fujishige, Satoru
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (16) : 2387 - 2401
  • [26] On graphs on n vertices having an identifying code of cardinality [log2(n+1)]
    Moncel, Julien
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (14) : 2032 - 2039
  • [27] A O(n log2 n) Checker and O(n2 log n) Filtering Algorithm for the Energetic Reasoning
    Ouellet, Yanick
    Quimper, Claude-Guy
    INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2018, 2018, 10848 : 477 - 494
  • [28] Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time
    Bilke, Andreas
    Cooper, Colin
    Elsaesser, Robert
    Radzik, Tomasz
    PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17), 2017, : 451 - 453
  • [29] Minimum Cut in O(m log2 n) Time
    Gawrychowski, Pawel
    Mozes, Shay
    Weimann, Oren
    THEORY OF COMPUTING SYSTEMS, 2024, 68 (04) : 814 - 834
  • [30] Comments on "wide-sense nonblocking multicast Log2 (N, m, p) networks"
    Danilewicz, Grzegorz
    Kabacinski, Wojciech
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2006, 54 (06) : 980 - 982
12345