4. STOC 1972: Denver, Colorado, USA

• Robert L. Constable, Steven S. Muchnick:
  Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems. 1-17
  
• S. A. Walker, H. Raymond Strong:
  Characterization of Flowchartable Recursions (Short Version). 18-34
  
• James H. Morris Jr.:
  Recursion Schemes with Lists. 35-43
  
• David A. Plaisted:
  Flowchart Schemata with Counters. 44-51
  
• Ashok K. Chandra, Zohar Manna:
  Program Schemas with Equality. 52-64
  
• Stephen J. Garland, David C. Luckham:
  On the Equivalence of Schemes. 65-72
  
• Stephen A. Cook, Robert A. Reckhow:
  Time-Bounded Random Access Machines. 73-80
  
• John C. Warkentin, Patrick C. Fischer:
  Predecessor Machines and Regressing Functions. 81-87
  
• Charles M. Fiduccia:
  Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited. 88-93
  
• David G. Kirkpatrick:
  On the Additions Necessary to Compute Certain Functions. 94-101
  
• H. T. Kung:
  A Bound on the Multiplication Efficiency of Iteration. 102-107
  
• Ellis Horowitz:
  Algorithms for Rational Function Arithmetic Operations. 108-118
  
• Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan:
  Linear Time Bounds for Median Computations. 119-124
  
• Richard M. Karp, Raymond E. Miller, Arnold L. Rosenberg:
  Rapid Identification of Repeated Patterns in Strings, Trees and Arrays. 125-136
  
• Jürg Nievergelt, Edward M. Reingold:
  Binary Search Trees of Bounded Balance. 137-142
  
• M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman:
  Worst-Case Analysis of Memory Allocation Algorithms. 143-150
  
• Walter J. Savitch:
  Maze Recognizing Automata (Extended Abstract). 151-156
  
• Neil D. Jones, Alan L. Selman:
  Turing Machines and the Spectra of First-Order Formulas with Equality. 157-167
  
• Claus-Peter Schnorr:
  The Process Complexity and Effective Random Tests. 168-176
  
• D. M. Symes:
  The Computation of Finite Functions. 177-182
  
• Albert R. Meyer, A. Bagchi:
  Program Size and Economy of Descriptions: Preliminary Report. 183-186
  
• Stephen A. Cook:
  A Hierarchy for Nondeterministic Time Complexity. 187-192
  
• Richard G. Hamlet:
  A Patent Problem for Abstract Programming Languages: Machine-Independent Computations. 193-197
  
• William F. Ogden, William C. Rounds:
  Compositions of n Tree Transducers. 198-206
  
• Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine:
  Uniformly Erasable AFL. 207-213
  
• Aristid Lindenmayer, Grzegorz Rozenberg:
  Developmental Systems and Languages. 214-221
  
• Ravi Sethi:
  Validating Register Allocations for Straight Line Programs. 222-237
  
• Matthew S. Hecht, Jeffrey D. Ullman:
  Flow Graph Reducibility. 238-250
  
• Alfred V. Aho, Jeffrey D. Ullman:
  A Technique for Speeding Up LR(k) Parsers. 251-263
  

Last update Fri May 25 08:42:05 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page