Journal of the ACM (JACM)


Search Issue
enter search term and/or author name


Journal of the ACM (JACM), Volume 25 Issue 2, April 1978

Stable Sorting in Asymptotically Optimal Time and Extra Space
Edward C. Horvath
Pages: 177-199
DOI: 10.1145/322063.322064

Optimal Arrangement of Keys in a Hash Table
Ronald L. Rivest
Pages: 200-209
DOI: 10.1145/322063.322065

Effective Automatic Indexing Using Term Addition and Deletion
C. T. Yu, G. Salton, M. K. Siu
Pages: 210-225
DOI: 10.1145/322063.322066

Asynchronous Iterative Methods for Multiprocessors
Gérard M. Baudet
Pages: 226-244
DOI: 10.1145/322063.322067

All Algebraic Functions Can Be Computed Fast
H. T. Kung, J. F. Traub
Pages: 245-260
DOI: 10.1145/322063.322068

An Example of a Skewing Function
William McKie
Pages: 261-265
DOI: 10.1145/322063.322069

Pivot Strategies for Primal-Simplex Network Codes
John M. Mulvey
Pages: 266-270
DOI: 10.1145/322063.322070

On the Efficiency of a Polynomial Irreducibility Test
David R. Musser
Pages: 271-282
DOI: 10.1145/322063.322071

Analysis and Applications of the Delay Cycle for the M/M/c Queueing System
K. Omahen, V. Marathe
Pages: 283-303
DOI: 10.1145/322063.322072

The method of analysis employing decomposition of busy periods has, in various forms, been applied to the M/G/1 queueing system under a variety of scheduling rules This paper extends the technique of decomposition of busy periods in order to...

A Direct Descent Binary Knapsack Algorithm
Andris A. Zoltners
Pages: 304-311
DOI: 10.1145/322063.322073

The Complexity of Finite Memory Programs with Recursion
Neil D. Jones, Steven S. Muchnick
Pages: 312-321
DOI: 10.1145/322063.322074

The Complexity of Some Problems on Subsequences and Supersequences
David Maier
Pages: 322-336
DOI: 10.1145/322063.322075

k + 1 Heads Are Better than k
Andrew C. Yao, Ronald L. Rivest
Pages: 337-340
DOI: 10.1145/322063.322076