Journal of the ACM （JOLACM） - Issue 240 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 240 |
| 发布时间： |
| 卷期年份： 2007 |
| 卷期官网： |
本期论文列表
When are elections with few candidates hard to manipulate?.
Dynamic ordered sets with exponential search trees.
Approximation via cost sharing: Simpler and better approximation algorithms for network design.
Characterizing and reasoning about probabilistic and non-probabilistic expectation.
The PCP theorem by gap amplification.