Journal of the ACM （JOLACM） - Issue 71 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 71 |
| 发布时间： |
| 卷期年份： 1972 |
| 卷期官网： |
本期论文列表
Linear and Context-Free Graph Grammars.
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph.
Addressless Units for Carrying Out Loop-Free Computations.
S-Semigroups of Automata.
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets.
Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows.
Computational Complexity and the Existence of Complexity Gaps.
Fuzzy Logic and the Resolution Principle.
What Is Computer Science?
Service in a Loop System.
The Operator Gap.
Analysis of Graphs by Ordering of Nodes.
Memory Requirements in a Multiprocessing Environment.
Analysis of Two Time-Sharing Queueing Models.