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 条
  • [41] Online Bipartite Matching with Amortized O(log2 n) Replacements
    Bernstein, Aaron
    Holm, Jacob
    Rotenberg, Eva
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 947 - 959
  • [42] Simple O(n log2 n) Algorithms for the Planar 2-Center Problem
    Tan, Xuehou
    Jiang, Bo
    COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 481 - 491
  • [43] Online Bipartite Matching with Amortized O(log2 n) Replacements
    Bernstein, Aaron
    Holm, Jacob
    Rotenberg, Eva
    JOURNAL OF THE ACM, 2019, 66 (05)
  • [44] Approximate distribution of log2(A + χ2) and its applications
    Qi, Yuan
    Qian, Rongrong
    Peng, Tao
    Wang, Wenbo
    IET COMMUNICATIONS, 2013, 7 (10) : 931 - 941
  • [45] rORAM: Efficient Range ORAM with O(log2 N) Locality
    Chakraborti, Anrin
    Aviv, Adam J.
    Choi, Seung Geol
    Mayberry, Travis
    Roche, Daniel S.
    Sion, Radu
    26TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2019), 2019,
  • [46] Monotone Boolean dualization is in co-NP[log2 n]
    Kavvadias, DJ
    Stavropoulos, EC
    INFORMATION PROCESSING LETTERS, 2003, 85 (01) : 1 - 6
  • [47] Wide-sense nonblocking log2 (N, 0, p) switching networks with even number of stages
    Kabacinski, W
    Michalski, M
    ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, 2005, : 1058 - 1062
  • [48] Performance Evaluation of the Blocking Windows Algorithm in Blocking Multicast log2(N, 0, p) Switching Networks
    Danilewicz, Grzegorz
    Dziuba, Marcin
    2014 16TH INTERNATIONAL TELECOMMUNICATIONS NETWORK STRATEGY AND PLANNING SYMPOSIUM (NETWORKS), 2014,
  • [49] Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
    Diks, Krzysztof
    Stanczyk, Piotr
    SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 321 - 333
  • [50] O(log (m)over-bar. log N) routing algorithm for (2 log N-1)-stage switching networks and beyond
    Chakrabarty, Amitabha
    Collier, Martin
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (10) : 3045 - 3055
12345