0004-5411

Journal of the ACM (JOLACM) - Issue 195 论文列表

点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息
卷期号: Issue 195
发布时间:
卷期年份: 1999
卷期官网:
本期论文列表
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.

Approximation in stochastic scheduling: the power of LP-based priority policies.

Analysis of a bounding box heuristic for object intersection.

The topological structure of asynchronous computability.