Volume 22, Number 1, January 1975
Leslie G. Valiant
: Regularity and Related Problems for Deterministic Pushdown Automata.
Harry T. Hsu
: An Algorithm for Finding a Minimal Equivalent Graph of a Digraph.
: Approximate Algorithms for the 0/1 Knapsack Problem.
: Derivation of a Path-Connectivity Matrix for Tagged Flowcharts.
Volume 22, Number 2, April 1975
Jair M. Babad
: A Generalized Multi-Entrance Time-Sharing Priority Queue.
: On Approximate Computer System Models.
, Micha Yadin
: A Processor in Series with Demand-Interrupting Devices - A Stochastic Model.
Volume 22, Number 3, July 1975
Gregory J. Chaitin
: A Theory of Program Size Formally Identical to Information Theory.
Glenn K. Manacher
: A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String.
Walter C. Oney
: Queueing Analysis of the Scan Policy for Moving-Head Disks.
: Errata: ``Testing for the Church-Rosser Property''.
: The Concept of Term Exclusiveness and Its Effect on the Theory of Boolean Functions.
Volume 22, Number 4, October 1975
: A Sorting Algorithm for Polynomial Multiplication.
: On the Parallel Evaluation of Certain Arithmetic Expressions.
Ivan Hal Sudborough
: A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages.
Bal Kishan Dass
: A Sufficient Bound for Codes Correcting Bursts with Weight Constraint.
Jeff R. Cash
: A Class of Implicit Runge-Kutta Methods for the Numerical Integration of Stiff Ordinary Differential Equations.
: Computer Search for Numerical Instability.
John P. Hayes
: The Fanout Structure of Switching Functions.