Communications of the ACM （CACM） - Issue 261 论文列表
| 点击这里查看 Communications of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 261 |
| 发布时间： |
| 卷期年份： 1979 |
| 卷期官网： |
本期论文列表
Line Numbers Made Cheap.
On the Proof of Correctness of a Calendar Program.
An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles.
Comment on: "An Optimal Evaluation of Boolean Expressions in an Online Query System".
A Note on: "An Optimal Evaluation of Boolean Expressions in an Online Query System".