Journal of the ACM （JOLACM） - Issue 120 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 120 |
| 发布时间： |
| 卷期年份： 1984 |
| 卷期官网： |
本期论文列表
Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes.
Complexity Results for Permuting Data and Other Computations on Parallel Processors.
Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks.
Symmetric Complementation.
The Three-Machine No-Wait Flow Shop is NP-Complete.
The VLSI Complexity of Selected Graph Problems.
Worst-case Analysis of Set Union Algorithms.
Serializability by Locking.
Finitely Specifiable Implicational Dependency Families.
Some Combinatorial Game Problems Require Omega(n
The omega-Sequence Problem for DOL Systems Is Decidable.
On the complexity of unique solutions.
Space-Time Trade-Offs for Banded Matrix Problems.
Beyond Floating Point.
Lower Bounds and Fast Algorithms for Sequence Acceleration.