Journal of the ACM（JOLACM ）的ISSUE 109论文列表

卷期号： Issue 109

发布时间：

卷期年份： 1981

卷期官网：

On Optimal Scheduling Algorithms for Time-Shared Systems.

Connected Component Labeling Using Quadtrees.

The Area-Time Complexity of Binary Multiplication.

Fast Algorithms for Solving Path Problems.

The Complexity of the Equivalence Problem for Simple Programs.

An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic.

A Unified Approach to Path Problems.

On J-maximal and J-minimal Flow-Shop Schedules.

Should Tables Be Sorted?

Corrigendum: "Mean-Value Analysis of Closed Multichain Queuing Networks".

A Unification Algorithm for Associative-Commutative Functions.

The Complexity of the Finite Containment Problem for Petri Nets.

Probabilistic Aspects of Boolean Switching Functions via a New Transform.

Optimal Time Minimal Space Selection Algorithms.