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

卷期号： Issue 138

发布时间：

卷期年份： 1988

卷期官网：

Eliminating go to's while preserving program structure.

Optimal VLSI circuits for sorting.

Computational limitations on learning from examples.

Meager and replete failures of relative completeness.

Finite monoids and the fine structure of NC

Many Hard Examples for Resolution.

Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service.

Parallel hashing: an efficient implementation of shared memory.

Computing on an anonymous ring.

A linear time algorithm for optimal routing around a rectangle.

Counting is easy.

A new class of heuristic algorithms for weighted perfect matching.

A new approach to the maximum-flow problem.

Addendum to "Initializing Generalized Feedback Shift Register Pseudorandom Number Generators".