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

卷期号： Issue 181

发布时间：

卷期年份： 1997

卷期官网：

A simple min-cut algorithm.

Approximating shortest paths on a convex polytope in three dimensions.

Robust wait-free hierarchies.

Scale-sensitive dimensions, uniform convergence, and learnability.

Erratum: "Two heads are better that two tapes".

Closure properties of constraints.

Constraint tightness and looseness versus local and global consistency.