Search ACM DL

Search Issue

enter search term and/or author name

**Bounds on the Complexity of the Longest Common Subsequence Problem**

J. D. Ullman, A. V. Aho, D. S. Hirschberg

Pages: 1-12

DOI: 10.1145/321921.321922

**Bounds for the String Editing Problem**

C. K. Wong, Ashok K. Chandra

Pages: 13-16

DOI: 10.1145/321921.321923

**On the Complete Covering Problem for LR(k)Grammars**

M. Dennis Mickunas

Pages: 17-30

DOI: 10.1145/321921.321924

**An Algorithm for Subgraph Isomorphism**

J. R. Ullmann

Pages: 31-42

DOI: 10.1145/321921.321925

**The Complexity of Near-Optimal Graph Coloring**

M. R. Garey, D. S. Johnson

Pages: 43-49

DOI: 10.1145/321921.321926

**A Shortest Path Algorithm for Edge-Sparse Graphs**

Robert A. Wagner

Pages: 50-57

DOI: 10.1145/321921.321927

**A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph**

Alberto Martelli

Pages: 58-73

DOI: 10.1145/321921.321928

**Note on Hopcroft and Tarjan's Planarity Algorithm**

Narsingh Deo

Pages: 74-75

DOI: 10.1145/321921.321929

**Precision Weighting—An Effective Automatic Indexing Method**

C. T. Yu, G. Salton

Pages: 76-88

DOI: 10.1145/321921.321930

**Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation**

Kenny S. Crump

Pages: 89-96

DOI: 10.1145/321921.321931

**Adaptive Allocation of Central Processing Unit Quanta**

D. Potier, E. Gelenbe, J. Lenfant

Pages: 97-102

DOI: 10.1145/321921.321932

**Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices**

R. A. Cody, E. G. Coffman, Jr.

Pages: 103-115

DOI: 10.1145/321921.321933

**Algorithms for Scheduling Independent Tasks**

Sartaj K. Sahni

Pages: 116-127

DOI: 10.1145/321921.321934

**The independence of miss ratio on page size**

Ronald Fagin, Malcolm C. Easton

Pages: 128-146

DOI: 10.1145/321921.321935

**A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables**

D. S. Hirschberg, C. K. Wong

Pages: 147-154

DOI: 10.1145/321921.321936

**A Code for the Transportation Problem of Linear Programming**

Britton Harris

Pages: 155-157

DOI: 10.1145/321921.321937

**Global Data Flow Analysis and Iterative Algorithms**

John B. Kam, Jeffrey D. Ullman

Pages: 158-171

DOI: 10.1145/321921.321938

**A Fast and Usually Linear Algorithm for Global Flow Analysis**

Susan L. Graham, Mark Wegman

Pages: 172-202

DOI: 10.1145/321921.321939

**A Completeness Theorem for Straight-Line Programs with Structured Variables**

Christoph M. Hoffmann, Lawrence H. Landweber

Pages: 203-220

DOI: 10.1145/321921.321940