ACM DL

Journal of the ACM (JACM)

Menu

Search Issue
enter search term and/or author name

Archive


Journal of the ACM (JACM), Volume 19 Issue 3, July 1972

An Algorithm for the Design of Simple Precedence Grammars
L. Presser, J. McAfee
Pages: 385-395
DOI: 10.1145/321707.321708

The Halting Problem for Probabilistic Context-Free Generators
Clarence A. Ellis
Pages: 396-399
DOI: 10.1145/321707.321709

Permutation Graphs and Transitive Graphs
S. Even, A. Pnueli, A. Lempel
Pages: 400-410
DOI: 10.1145/321707.321710

Graph Structures
John L. Pfaltz
Pages: 411-422
DOI: 10.1145/321707.321711

Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using 12N3 Additions and N3 Comparisons
Jin Y. Yen
Pages: 423-424
DOI: 10.1145/321707.321712

Practical Aspects of Doubly Chained Trees for Retrieval
L. E. Stanfel
Pages: 425-436
DOI: 10.1145/321707.321713

Inversion of Persymmetric Matrices Having Toeplitz Inverses
Nancy M. Huang, Randall E. Cline
Pages: 437-444
DOI: 10.1145/321707.321714

Nonpriority Multiprogramming Systems Under Heavy Demand Conditions—Customers' Viewpoint
I. Mitrani
Pages: 445-452
DOI: 10.1145/321707.321715

Busy Period Analysis of a Time-Sharing System: transform inversion
Richard E. Nance, U. Narayan Bhat, Billy G. Claybrook
Pages: 453-463
DOI: 10.1145/321707.321716

Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System
L. Kleinrock, R. R. Muntz
Pages: 464-482
DOI: 10.1145/321707.321717

A Stochastic Model for Message Assembly Buffering with a Comparison of Block Assignment Strategies
Gary D. Schultz
Pages: 483-495
DOI: 10.1145/321707.321718

An Approach for Finding C-Linear Complete Inference Systems
James R. Slagle
Pages: 496-516
DOI: 10.1145/321707.321719

The Expression of Algorithms by Charts
J. Bruno, K. Steiglitz
Pages: 517-525
DOI: 10.1145/321707.321720

Subrecursive Programming Languages, Part I: efficiency and program structure
Robert L. Constable, Allan B. Borodin
Pages: 526-568
DOI: 10.1145/321707.321721

A Note on the Efficiency of Hashing Functions
J. D. Ullman
Pages: 569-575
DOI: 10.1145/321707.321722

Corrigendum: `` Computational Complexity and the Existence of Complexity Gaps''
A. Borodin
Page: 576
DOI: 10.1145/321707.321723