SIAM Journal on Computing, Volume 1

Volume 1, Number 1, March 1972

• Alfred V. Aho, Jeffrey D. Ullman:
  Optimization of Straight Line Programs. 1-19
  
• Ronald V. Book:
  Terminal Context in Context-Sensitive Grammars. 20-30
  
• Frank K. Hwang, Shen Lin:
  A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets. 31-39
  
• Arnold L. Rosenberg:
  Symmetries in Data Graphs. 40-65
  
• Robert L. Constable, David Gries:
  On Classes of Program Schemata. 66-118
  
• Raymond E. Miller:
  Some Undecidability Results for Parallel Program Schemata. 119-129
  

Volume 1, Number 2, June 1972

• Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman:
  The Transitive Reduction of a Directed Graph. 131-137
  
• Donald P. Gaver:
  Asymptotic Service System Output, with Application to Multiprogramming. 138-145
  
• Robert Endre Tarjan:
  Depth-First Search and Linear Graph Algorithms. 146-160
  
• Alan G. Konheim:
  A Note on Merging. 161-166
  
• J. F. Traub:
  Computational Complexity of Iterative Processes. 167-179
  
• Fanica Gavril:
  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph. 180-187
  
• Matthew S. Hecht, Jeffrey D. Ullman:
  Flow Graph Reducibility. 188-202
  

Volume 1, Number 3, September 1972

• D. M. Jackson:
  Expectations of Functions of Sequences over Finite Alphabets with Given Transition Probabilities by Methods Independent of Sequence Length. 203-217
  
• Gerald S. Shedler, C. Tung:
  Locality in Page Reference Strings. 218-241
  
• Steven Brown, David Gries, Thomas G. Szymanski:
  Program Schemes with Pushdown Stores. 242-268
  
• Edward G. Coffman Jr., L. A. Klimko, Barbara Ryan:
  Analysis of Scanning Policies for Reducing Disk Seek Times. 269-279
  

Volume 1, Number 4, December 1972

• Ronald V. Book:
  On Languages Accepted in Polynomial Time. 281-287
  
• Leonard J. Bass:
  A Note on the Intersection of Complexity Classes of Functions. 288-289
  
• C. L. Liu:
  Analysis and Synthesis of Sorting Algorithms. 290-304
  
• Alfred V. Aho, Thomas G. Peterson:
  A Minimum Distance Error-Correcting Parser for Context-Free Languages. 305-312
  
• Richard B. Kieburtz, David C. Luckham:
  Compatibility and Complexity of Refinements of the Resolution Principle. 313-332
  
• Michael A. Harrison, Ivan M. Havel:
  Real-Time Strict Deterministic Languages. 333-349
  
• Edward M. Reingold:
  Infix to Prefix Translation: The Insufficiency of a Pushdown Stack. 350-353
  

Last update Tue May 21 19:34:24 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page