Journal of the ACM （JOLACM） - Issue 141 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 141 |
| 发布时间： |
| 卷期年份： 1989 |
| 卷期官网： |
本期论文列表
Recognizing circle graphs in polynomial time.
Optimal bounds for decision problems on the CRCW PRAM.
Efficient implementation of graph algorithms using contraction.
New lower bounds for parallel computation.
Simple constant-time consensus protocols in realistic failure models.
Invariance of complexity measures for networks with unreliable gates.
Acyclic fork-join queuing networks.
Optimum lopsided binary trees.
Hierarchical planarity testing algorithms.
A trade-off between space and efficiency for routing tables.