Journal of the ACM （JOLACM） - Issue 201 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 201 |
| 发布时间： |
| 卷期年份： 2000 |
| 卷期官网： |
本期论文列表
On the sorting-complexity of suffix tree construction.
Minimizing stall time in single and parallel disk systems.
Contention resolution with constant expected delay.
The soft heap: an approximate priority queue with optimal error rate.
A minimum spanning tree algorithm with Inverse-Ackermann type complexity.