Journal of the ACM （JOLACM） - Issue 139 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 139 |
| 发布时间： |
| 卷期年份： 1989 |
| 卷期官网： |
本期论文列表
Inferring sequences produced by pseudo-random number generators.
Maintaining state constraints in relational databases: a proof theoretic basis.
Minimizing function-free recursive inference rules.
A common schema for dynamic programming and branch and bound algorithms.
A counter-example for "A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars".
A unified framework for race analysis of asynchronous networks.
A note on probabilistically verifying integer and polynomial products.
Incremental modular decomposition.
Calculating joint queue-length distributions in product-form queuing networks.
Multiplicative complexity of polynomial multiplication over finite fields.
Calculating availability and performability measures of repairable computer systems using randomization.