Journal of the ACM （JOLACM） - Issue 87 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 87 |
| 发布时间： |
| 卷期年份： 1976 |
| 卷期官网： |
本期论文列表
A Shortest Path Algorithm for Edge-Sparse Graphs.
Adaptive Allocation of Central Processing Unit Quanta.
Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices.
A Completeness Theorem for Straight-Line Programs with Structured Variables.
Algorithms for Scheduling Independent Tasks.
The Complexity of Near-Optimal Graph Coloring.
A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph.
The independence of miss ratio on page size.
On the Complete Covering Problem for LR(k)Grammars.
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables.
Global Data Flow Analysis and Iterative Algorithms.
A Fast and Usually Linear Algorithm for Global Flow Analysis.
Precision Weighting - An Effective Automatic Indexing Method.
Bounds on the Complexity of the Longest Common Subsequence Problem.
Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation.
Note on Hopcroft and Tarjan's Planarity Algorithm.
A Code for the Transportation Problem of Linear Programming.
Bounds for the String Editing Problem.
An Algorithm for Subgraph Isomorphism.