Journal of the ACM （JOLACM） - Issue 181 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： 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.