Volume 5,
Number 1,
March 1976
Volume 5,
Number 2,
June 1976
Volume 5,
Number 3,
September 1976
Volume 5,
Number 4,
December 1976
- Bharat Kinariwala, Kabekode V. S. Bhat:
Theory of Output Set Assignments and Degree Switching Operations.
589-601
- S. G. Williamson:
Ranking Algorithms for Lists of Partitions.
602-617
- L. Csanky:
Fast Parallel Matrix Inversion Algorithms.
618-623
- Roger W. Brockett, David P. Dobkin:
On the Number of Multiplications Required for Matrix Multiplication.
624-628 ,
Errata:
SIAM J. Comput. 7(2):
238 (1978)
- Takao Asano, Michiro Shibui, Itsuo Takanami:
General Results on Tour Lengths in Machines and Digraphs.
629-645
- Robert Solovay:
On Sets Cook-Reducible to Sparse Sets.
646-652
- Kapali P. Eswaran, Robert Endre Tarjan:
Augmentation Problems.
653-665
- John C. Cherniavsky:
Simple Programs Realize Exactly Presberger Formulas.
666-677
- Amnon Barak, Eliahu Shamir:
On the Parallel Evaluation of Boolean Expressions.
678-681
- Francis Y. L. Chin:
A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation.
682-690
- Shimon Even, Alon Itai, Adi Shamir:
On the Complexity of Timetable and Multicommodity Flow Problems.
691-703
- M. R. Garey, David S. Johnson, Robert Endre Tarjan:
The Planar Hamiltonian Circuit Problem is NP-Complete.
704-714
- W. J. Hendricks:
An Account of Self-Organizing Systems.
715-723
- David R. Cheriton, Robert Endre Tarjan:
Finding Minimum Spanning Trees.
724-742
- Alan Jay Smith:
Analysis of the Optimal, Look-Ahead Demand Paging Algorithms.
743-757
- Leonard J. Bass:
Errata: On Optimal Processor Scheduling for Multiprogramming.
758 ,
->SIAM J. Comput. 2(4):
273-280 (1973)
Copyright © Sat Nov 28 22:33:32 2009
by Michael Ley (ley@uni-trier.de)
