COMPLEXITY OF MONOTONE NETWORKS FOR CERTAIN BILINEAR FORMS, ROUTING PROBLEMS, SORTING, AND MERGING

被引：0
|
作者：
LAMAGNA, EA
机构：
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1979年 / 28卷 / 10期
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：773 / 782
页数：10
相关论文
共 4 条
  • [1] Accelerating certain outputs of merging and sorting networks
    Levi, Tamir
    Litman, Ami
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3725 - 3732
  • [2] POSSIBILITIES FOR MERGING SORTING AND SEARCHING IN CERTAIN DATA ORGANIZATION PROBLEMS
    RUDELSON, LY
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1991, 29 (04): : 1 - 9
  • [3] Further Complexity Results for Routing Schedule Problems of Networks
    Lu, Yong
    Zuo, Zhihong
    He, Huaiwen
    Li, Ruifang
    IEEE Networking Letters, 2019, 1 (04): : 164 - 167
  • [4] NETWORK COMPLEXITY OF SORTING AND GRAPH PROBLEMS AND SIMULATING CRCW PRAMS BY INTERCONNECTION NETWORKS - (PRELIMINARY VERSION)
    AGGARWAL, A
    HUANG, MDA
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 319 : 339 - 350
1