SIAM Journal on Computing, Volume 5
Volume 5, Number 1, March 1976
- Alon Itai: Optimal Alphabetic Trees. 9-18
- Ronald L. Rivest: Partial-Match Retrieval Algorithms. 19-50
- Lawrence J. Mazlack: Machine Selection of Elements in Crossword Puzzles: An Application of Computational Linguistics. 51-72
- Ravi Sethi: Scheduling Graphs on Two Processors. 73-82
- Michael L. Fredman: New Bounds on the Complexity of the Shortest Path Problem. 83-89
- Andrew Chi-Chih Yao: On the Evaluation of Powers. 100-103
- Laurent Hyafil: Bounds for Selection. 109-114
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: On Finding Lowest Common Ancestors in Trees. 115-132
- Tatsuo Ohtsuki: A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph. 133-145
- Ken Kennedy: A Comparison of Two Algorithms for Global Data Flow Analysis. 158-180
Volume 5, Number 2, June 1976
- Robert L. Probert: On the Additive Complexity of Matrix Multiplication. 187-203
- Webb Miller: Graph Transformations for Roundoff Analysis. 204-216
- Ivan Hal Sudborough, A. Zalcberg: On Families of Languages Defined by Time-Bounded Random Access Machines. 217-230
- Thomas G. Szymanski, John H. Williams: Noncanonical Extensions of Bottom-Up Parsing Techniques. 231-250
- Y. Edmund Lien: Termination Properties of Generalized Petri Nets. 251-265
- Donald J. Rose, Robert Endre Tarjan, George S. Lueker: Algorithmic Aspects of Vertex Elimination on Graphs. 266-283
- Sven Skyum: Decomposition Theorems for Various Kinds of Languages Parallel in Nature. 284-296
- Jay P. Fillmore, S. G. Williamson: Ranking Algorithms: The Symmetries and Colorations of the n-Cube. 297-304
- Leon S. Levy: Local Adjunct Languages and Regular Sets. 305-308
- Arthur J. Bernstein: Synthesizing a Response Function with a Feedback Scheduling Algorithm. 309-317
- Dorothy Bollman: On Preserving Proximity in Extendible Arrays. 318-323
- Volker Strassen: Computational Complexity over Finite Fields. 324-331
Volume 5, Number 3, September 1976
- Edward A. Ashcroft, William W. Wadge: Lucid - A Formal System for Writing and Proving Programs. 336-354
- Susan L. Gerhart: Proof Theory of Partial Correctness Verification Systems. 355-377
- Ashok K. Chandra: Generalized Program Schemas. 402-413
- Steven S. Muchnick: Computational Complexity of Multiple Recursive Schemata. 427-451
- Gordon D. Plotkin: A Powerdomain Construction. 452-487
- Christopher P. Wadsworth: The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus. 488-521
- Dana S. Scott: Data Types as Lattices. 522-587
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
- 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
- John C. Cherniavsky: Simple Programs Realize Exactly Presberger Formulas. 666-677
- 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
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team