Journal of the ACM （JOLACM） - Issue 113 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 113 |
| 发布时间： |
| 卷期年份： 1982 |
| 卷期官网： |
本期论文列表
Critical Path Scheduling with Resource and Processor Constraints.
Two-Way Counter Machines and Diophantine Equations.
Preemptive Scheduling with Release Times, Deadlines, and Due Times.
Linear-time computability of combinatorial problems on series-parallel graphs.
An Almost-Linear Algorithm for Two-Processor Scheduling.
On Parallel Computation for the Knapsack Problem.
Inference of Reversible Languages.
Testing satisfaction of functional dependencies.
Parallel permutation and sorting algorithms and a new generalized connection network.
Some Exact Complexity Results for Straight-Line Computations over Semirings.
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions.
The Compilation of Regular Expressions into Integrated Circuits.
Contributions to the Theory of Logic Programming.
Corrigendum: "The Area-Time Complexity of Binary Multiplication".
Properties of functional-dependency families.
A Theory of Safe Locking Policies in Database Systems.
A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means.